A common algorithm for detecting deadlocks $($DEADLOCK$-$DETECT$)$ is the following:

$1.$ Mark each process that has a row in the Allocation matrix $($A$)$ of all zeros.

$2.$ Initialize a temporary vector W to equal the Available vector $($V$).$

$3.$ Find an index i such that process i is currently unmarked and the i

th row of Q is less than or equal to W$.$ That is Qij

$<=$ Wj$,$ for $1<=$ j $<=$ m$.$

i$.$ If no such row is found, terminate the algorithm.

ii$.$ If such a row is found, mark process i and add the corresponding row of the allocation matrix to W$.$ That is$,$ set

Wj $=$ Wj $+$ Aij, for $1<=$ j $<=$ m$.$

$4.$ Return to step $3.$

A deadlock exists if and only if there are unmarked processes at the end of the algorithm.

Given the following resource matrices, where Rj refers to a resource and m is the number of resources

$(4$ in this problem$)1<=$ j $<=$ m; and Pi refers to a process and n is the number of processes $(5$ in this

problem$)1<=$ i $<=$ n: