b. Suppose a system has 5 processes, P = {P1, P2, P3, P4, Ps), and 4 resources types, R = {R1, R2, R3, R4). Further, assume one instance of each resource type. The current state of the system is defined by the following requests and assignments; 1. 2. 3. 4. P1 is requesting R3 and has been assigned R2 P2 is requesting Ri and has been assigned R3 P3 is requesting R4 and has been assigned R1 P4 is requesting R3 5. Ps is requesting R2 and has been assigned R4 Is there deadlock in this system (Explicitly state that there is or is not)? If appropriate graph to justify your answer, or, if you conclude there is no deadlock, your justification should contain a sequence of execution for the processes which shows that all processes can execute to completion