P is a set of processes. R is a set of resources. The sets P, and R are as follows P P, P2, P3 , P4, P5, Po), R-{Ri, R2, R3, R4, Rs! . P is requesting a resource of type R1 e P2 has been allocated a resource of type R2 . P is requesting a resource of type R3, but the system has allocated the only R3 resource to P4 .Ps is requesting a resource of type R4, the only one of which the system has allocated to P6 Pa, is requesting a resource of type R5, the only one of which the system has allocated to process Ps Ri has two instances. R2 has two instances. R3 has one instance. R4 has one instance. Rs has one instance. a. Draw the resource- allocation graph. b. Is there any deadlock in this situation? Briefly Explain