b$)$ Suppose, in a workplace, we have a set of resource types, R $=\{$R$1,$ R$2,$ R$3,$ R$4\}$ and a set of processes, P $=\{$P$1,$ P$2,$ P$3,$ P$4,$ P$5\}.$ R$1,$ R$2,$ R$3,$ and R$4$ have $3,1,4,$ and $2$ instances respectively.

P$1$ is holding $2$ instances of R$1$

P$2$ is holding $1$ instance of R$3$

P$3$ is holding $1$ instance of R$4$

P$5$ requests $2$ instances of R$3$

P$4$ is holding $1$ instance of R$4$

P$3$ requests $1$ instance of R$2$

P$2$ requests $1$ instance of R$1$

P$2$ is holding $1$ instance of R$2$

P$1$ is requesting $1$ instance of R$4$

P$3$ is holding $1$ instance of R$3$

P$4$ is holding $1$ instance of R$3.$

Construct a resource allocation graph for the above scenario and identify the cycle $($if any$)$ and decide whether there is a deadlock or not.