PLEASE I NEED THIS NOWPLEASE I NEED THIS NOW

Question 1 [30 points] A system has four processes executing and competing for 3 resource types. Processes set: {P1, P2, P3, P4} Resources set: R1, R2, R3} Request and assignment edges set: {P1-R1, P3-R2, R2-P1, R2P4, R1-P2, R1--P3} Resource R1: has 2 instances Resource R2: has 2 instances Resource R3: has 1 instance a. Draw the resource allocation graph based on the information given above. Use arrows from the Insert Shapes. (18 pts) P2 P1 R1 R3 P3 (*) P4 R2 b. Identify the cycle(s) available in the graph (if any). (6 pts) c. Then justify if there is a deadlock or not. Provide all details (6 pts)