$9-$ Is there a deadlock in the following resource allocation graph? Justify your answer by using wait$-$for graph. Answer alone receives score of zero.

a$.$ Show your final wait$-$for graph separately.

b$.$ List the processes that make the wait$-$for graph $(\backslash (\backslash$mathbf$\{2\}\backslash$mathbf$\{$~ p t s $.)\}\backslash )$ and

c$.$ for each process, Pi $,$ provide the name of processes that can be directly reached from Pi $(8$ pts $.)$ For example, if one of the processes in the wait$-$for graph is P $2$ and from P $2$ three arrows go out to process $\backslash (\backslash$mathrm$\{$P$\}1,\backslash$mathrm$\{$P$\}3\backslash ),$ and P $4,$ then the list of directly accessed processes from P $2$ includes $\backslash (\backslash$mathrm$\{$P$\}1,\backslash$mathrm$\{$P$\}3\backslash ),$ and P $4.$