Consider a system with four processes P1, P2, P3, and P4, and two resources, R1, and R2, respectively. Each resource has two instances. Furthermore: P1 allocates an instance of R2, and requests an instance of Ri; P2 allocates an instance of R1, and doesn't need any other resource: P3 allocates an instance of R1 and requires an instance of R2, P4 allocates an instance of R2, and doesn't need any other resource If you draw the resource allocation graph: a) Is there a cycle in the graph? If yes name it. (example: P1,P2,P3,P4) b) If there is a cycle, examine if the system is deadlocked or not? explain your