$1.$ Given four processes P $1$ to P $4$ and one each of six different resource types R $1$ to $\backslash (\backslash$mathrm$\{$R$6\}\backslash ),$ the following processes are currently allocated the following resources:

a$.$ P$1$: R$1$

b$.$ P$2$: R$2,$ R$3$

c$.$ P$3$: R$4$

d$.$ P$4$: none

The following processes are requesting the following resources:

e$.$ P$1$: R$2$

f$.$ P$2$: R$4$

g$.$ P$3$: R$5$

h$.$ P$4$: R$1,$ R$3,$ R$6$

Is this deadlocked? Draw a graph to show your work.