Use the deadlock detection algorithm in Section 6.4.2 of the textbook (Modern Operating Systems) to answer this problem. Suppose you have two processes, P1 and P2, and below are there current allocation (C) and request matrices (R), along with resources in existence (E) and resources available (A) matrices.

Is there currently a deadlock condition between P1 and P2? Explain your answer.

C = 0 2 0 1 R = 1 2 0 2 E = 1 2 2 2 A = 0 0 1 1

1 0 1 0

1 1 1 0