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 $=($P$1,$ P$2,$ P$3,$ P$4,$ P$5)$ R$=\{$R$1,$ R$2,$ R$3,$ R$4\}$ E $=($R$2-->$ PI$.$PL $-->$RI$.$R$1-->$ P$2.$ R$2$ SP$2,$ P$2-->$ R$3,$ R$3..>$ P$3,$ P$3-->$ R$2,$ R$2-->$ P$4)$ resource type Ri has one instance resource type R$2$ has three instances resource type R$3$ 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$)$