Consider the following system with five processes: P1, P2, P3, P4, P5, and five resources R1, R2, R3, R4, and R5. Given the following edges of the current resource allocation graph: P1 R1, R1 P2, P2 R3, P2 R4, P2 R5, P3 R5, P4 R2, R2 P1, R3 P5, R4 P3, R5 P4.

a. Draw the resource allocation graph of this system at the current state

b. Detect all cycles in the above graph and determine whether deadlock occurs or not.