$2\mathrm{.}1$

a$.$ Suppose the following codes are scheduled for execution line by line from P$0$ to P$3.$ Using a resource allocation graph, show the possibility of a deadlock in this implementation.

$(10$ marks$)$

b$.$ Modify the order of some of the get requests to prevent the possibility of any deadlock.

$(5$ Marks$)$

c$.$ Is it possible that a resource deadlock involves multiple units of one type and a single unit of another? If so$,$ give an example.

$(5$ marks$)$

$2\mathrm{.}2$ Given the following state of a system:

o The system comprises of five processes and four resources.

o P$1$P$5$ denotes the set of processes.

o R$1$R$4$ denotes the set of resources.

o Total Existing Resources:

$$ R$1$: $6$

$$ R$2$: $3$

$$ R$3$: $4$

$$ R$4$: $3$

o Snapshot at the initial time stage:

Allocation

Claim