P$3$ is requesting to R$3,$ R$1$ is assigned to P$5,$ P$5$ is requesting to R$5,$ P$10$ is requestign to R$5,$ R$5$ is assigned to P$3,$ R$10$ is assigned to P$5,$ R$10$ is assigned to P$8,$ P$11$ is requesting R$10,$ R$6$ is assigned to P$8,$ R$6$ is assigned to P$4,$ R$2$ is assigned to P$4,$ R$2$ is assigned to P$2,$ R$2$ is assigned to P$6,$ R$9$ is assigned to P$3,$ R$2$ is assigned to P$6,$ P$7$ is requesting to R$8,$ P$1$ is requesting to R$7,$ P$11$ is requesting to R$2,$ P$9$ is requesting to R$4,$ R$4$ is assigned to P$1,$ R$7$ is assigned to P$7,$ P$10$ is requesting to R$1,$P$7$ is requestign to R$2,$ P$7$ is requesting to R$8,$ R$8$ is assigned to P$9,$ P$9$ is requesting to R$9,$ P$9$ is requestign to R$1,$ R$3$ is assigned to P$1$

Draw the

a$)$ Resource allocation graph?

b$)$ Find whether there is any dead lock in the above graph?

c$)$ Recover the dead lock, if any. And mention the name of method that you have used.