1. Consider two cooperating processes P5 and P6. Suppose that, at any time, P6 want to enter its critical section. Write an algorithm using Petersons solution which shows that P6 can finally enter into its criticalsection. Consider the turn value for P5 to be 10 and P6 to be 12.

2. Consider a system with three processes P1, P2 and P3. There are four resources, R1, R2, R3 and R4. R3 has two instances. Other resources have single instance. P1 is holding R1 and R2. P2 is holding one instances of R3 and requesting R2. P3 is holding one instances of R3 and requesting R1. Draw the resource allocation graph. Is it a deadlock situation? Justify your answer.