Q$3$a$)$ A resource allocation system that uses the Banker's algorithm for $3$ resource types $($A$,$ B$,$ C$)$ and $5$ users $($P$0,$ P$1,$ P$2,$ P$3$ P$4)$ with Available $(3,3,2)$ is currently in the following state:$1-$ Is the state safe? If you answer yes, give a sequence of process ids that leads to all processes completed. If you answer no$,$ give a sequence of activities that results in a deadlocked state.

$2-$ Is there an ongoing request other than P$2\text{'}$s that cannot be granted immediately. Justify your answer.

Proc.

P$0$ P$1$ P$2$ P$3$ P$4$

Allocation.

A $02320$

B $10010$

C $00212$

Max

A $73924$

B $52023$

C $32223$

Request

A $30602$

B $22013$

C $21000$