B. Suppose a system has 5 processes, P = {P_1, P_2, P_3, P_4, P_5}, and 4 resources, R = {R_1, R_2, R_3, R_4}, where W = {2, 1, 3, 3}. The current state of the system is defined by the following requests and assignments; 1. P_1 is requesting an instance of R_3 and has been assigned an instance of R_2 2. P_2 is requesting an instance of R_1 and has been assigned an instance of assigned R_3 3. P_3 is requesting an instance of R_4 and has been assigned an instance of R_1 and an instance of R_3 4. P_4 is requesting an instance of R_3 5. P_5 is requesting an instance of R_2 and has been assigned an instance of R_4 Is there a cycle in the resource-allocation graph? Is there deadlock in this system? Thoroughly justify your answer. If there is no deadlock vour justification should contain a sequence of execution for the processes