operating system

the following problem you can use a paper to draw the graph and then answer the questions given below: onsider the following resource allocation graph: P = (P1, P2, P3, P4, P5) R= {R1, R2, R3, R4} E = (R2 --> PI.PL -->RI.R1 --> P2. R2 SP2, P2 --> R3, R3 ..> P3, P3 --> R2, R2 --> P4) resource type Ri has one instance resource type R2 has three instances resource type R3 has one instance resource type RA has three instances Answer the following questions Does the graph contain cycle? (2 marks) b. Is there any deadlock? Explain your answer [1 mark)