Consider the following resource

allocation graph has:

Set of processes, $,$

P$4\}$

Set of resources, $R=\{R1,R2,R3\}$

Set of edges, E$=\{$P$1->$R$3,$ P$2->$R$1$

$,P3R2,R1P1,R1P3,$

$R2P1,R2P2,R2P4,R3$

$P2,R3P4$

Resource type R$1$ has $2$

instances.

Resource type R$2$ has $3$

instances.

Resource type R$3$ has $2$

instances.

Draw the resource allocation graph

and explain the possibility of deadlock.

Answer: No deadlock.