Consider the following set of resources and processes : P= {P1, P2, P3, P4}, is the set of processes and R= {R1, R2}, is the set of resources with 2 instances each. If E= {P1-R1, P3R2, R1P2, R1>P3, R2P1, R2>P4} is the set of edges, Draw the resource allocation graph, identify and write the cycle(s) and also state whether there is a deadlock or not