Question no 4 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 R1; 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 A. Draw the resource allocation graph. B. Is there a cycle in the graph? C. Is the system in deadlock? If yes, explain why. If not, give a possible sequence of executions after which every process completes. D. Draw wait-for graph of this RAG.*