Consider a system that deals with deadlocks by periodically detecting them and resolving them. Whenever a process requests a resource, it is granted to the process if the resource is free. Otherwise, the process is blocked, waiting for the resource.

Whenever a process releases a resource, if there are other processes waiting for that resource, the resource is granted to the first waiter in the list. All other waiters now wait for the new holder of the resource to release the resource.

Periodically, a deadlock$-$detection algorithm is run. This algorithm builds a wait$-$for graph for the processes and identifies the set of processes that are deadlocked. Note that each process in the system corresponds to a vertex in the wait$-$for graph and an arc $\backslash (\backslash$mathrm$\{$Pi$\}\backslash$rightarrow $\backslash$mathrm$\{$Pj$\}\backslash )$ in the wait$-$for graph represents the fact that process Pi is waiting for a resource currently held by process Pj $.$ When the system is ascertained to have deadlocks $($i$.$e$.,$ the wait$-$for graph has cycles$)$ one or more processes that are deadlocked $($i$.$e$.,$ part of the cycles in the wait$-$for$-$graph$)$ are aborted so that the system is free from deadlocks $($i$.$e$.,$ there are no cycles in the resulting wait$-$for graph$).$

Now, consider the following sequence of resource requests in the system $($note that REQ$($A$,$ B$)$ indicates a request by process $\backslash ($ A $\backslash )$ for resource $\backslash ($ B $\backslash ))$:

$-$ REQ$($P$4,$ R$3)$

$-$ REQ$($P$2,$ R$5)$

$-$ REQ$($P$6,$ R$1)$

$-$ REQ$($P$4,$ R$1)$

$-$ REQ$($P$5,$ R$5)$

$-$ REQ$($P$2,$ R$3)$

$-$ REQ$($P$7,$ R$0)$

$-$ REQ$($P$1,$ R$6)$

$-$ REQ$($P$3,$ R$6)$

$-$ REQ$($P$9,$ R$0)$

$-$ REQ$($P$8,$ R$6)$

$-$ REQ$($P$6,$ R$5)$

$-$ REQ$($P$1,$ R$1)$

$-$ REQ$($P$7,$ R$3)$

After processing the above sequence of requests, let the deadlock$-$detection algorithm be run. Determine all of the processes that are deadlocked. Identify the process, from below, that can be aborted so that the system becomes deadlock free?

A$)$ P$2$

B$)$ P$3$

C$)$ P$1$

D$)$ P$5$