Long Answer Question Consider the following set of resources and processes: P= {P1, P2, P3, P4}, is the set of processes and R= {RI, R2), is the set of resources with 2 instances each. If E= {P1 R1, P3-R2, R1_P2, RI-P3, R2-P1, 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? Attach File Browse My Computer