Fill in the missing step in the following deadlock situation. Two users from the local board of education are each running a program (P1 and P2), and both programs will eventually need two DVD drives to copy files from one disc to another. Only two DVD-R drives are available and they’re allocated on an "as requested" basis. Soon the following sequence transpires:

Complete Question:

Fill in the missing step in the following deadlock situation. Two users from the local board of education are each running a program (P1 and P2), and both programs will eventually need two DVD drives to copy files from one disc to another. Only two DVD-R drives are available and they’re allocated on an “as requested” basis. Soon the following sequence transpires:

1. P1 requests drive 1 and gets it.

2.

3. P1 requests drive 2 but is blocked.

4. P2 requests drive 1 but is blocked.

a.P1 requests drive 2.

b.P2 requests drive 2 and gets it.

c.P2 requests drive 1 but is blocked.

d.P1 releases drive 1.

Soon the following sequence transpires:

P2 requests drive 2 and gets it.

Explanation:

A deadlock is a condition where two computer programs allocate the same resource essentially prevent access by each other and both programs stop working.

When every process or thread is awaiting for a resource to be released which is managed by another process a number of processes or themes are blocked.

Here is an example of a deadlock scenario. All connections are blocked; everybody hopes to see an incident that never takes place.