Please sir solve this Question as soon as possible

I will upvote YOU sir pls

[3+1] b) Consider the following resource allocation graph. P. R, o O P. PS 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? [1+1] c) What is the hold and wait condition for deadlock? Explain why violation of this condition is sufficient to prove tha no deadlock among the set processes even if mutual exclusion and no-preemption conditions are valid