Match the deadlock-related concepts in List I with their most accurate descriptions in List II.

List I (Concept)

A. Deadlock Prevention

B. Deadlock Avoidance

C. Deadlock Detection

D. Circular Wait

List II (Description)

1.A necessary condition for deadlock where a closed chain of processes exists, each holding at least one resource needed by the next process in the chain.

2.A strict, proactive strategy designed to ensure that at least one of the four necessary conditions for a deadlock can never hold.

3.A strategy (utilizing tools like Banker's Algorithm) that dynamically assesses each resource request to ensure the system always remains in a "safe state."

4.A permissive strategy that allows the system to enter a deadlocked state, identifies it using tools like a wait-for graph, and then initiates recovery.

Select the correct matching code from the options below: