- Consider the following resource allocation graph. P. R E P. P i) Convert it to the matrix representation (i.e., Find matrix for Allocation, request, and Available). ii) Is there a deadlock? If there is a deadlock, which processes are involved? What is the hold and wait condition for deadlock? Explain why violation of this condition is sufficient to prove that there is no deadlock among the set of processes even if mutual exclusion and no-preemption conditions are valid