A system has three processes $(P1,P2,P3)$ and three resources $).$ There are two instances of $R1.$ There is one instance of $R2.$ There are three instances of $R3.$

$,P1$ holds an R$1$ and an R$3$ and is requesting an R$2.$

$P2$ holds an $R1$ and an $R2$ and is requesting an $R3.$

$,P3$ hold an $R3$ and is requesting an R$2.$

Draw the resource allocation graph for this situation. Does a deadlock exist?

$[15$ pts$]$