Consider a system with five processes and four resources, each with a specific number of instances. Resource R1 has two instances, R2 has one instance, R3 has four instances, and R4 has two instances. Among the processes, P1 holds one instance of R1 and R3 and requests an additional instance of R2. P2 holds one instance of R4 and requests an additional instance of R2. P3 holds one instance of R2 and R3. P4 holds one instance of R3 and R4 and requests an additional instance of R1. Finally, P5 holds one instance of R1 and R3.

(a) Draw Resource Allocation Graph (RAG) for the above scenario.

(b) Draw wait-for graph from RAG.

(c) Using the resource allocation graph (RAG) from (a), determine if a deadlock exists.

Please explain also how did you draw a,b,c .....