Consider the following snapshot of a system:
$Allocation$ $Max$ $Available$
$A$ $B$ $C$ $D$ $A$ $B$ $C$ $D$ $A$ $B$ $C$ $D$
$P_0$ $2$ $0$ $0$ $1$ $4$ $2$ $1$ $2$ $3$ $3$ $2$ $1$
$P_1$ $3$ $1$ $2$ $1$ $5$ $2$ $5$ $2$
$P_2$ $2$ $1$ $0$ $3$ $2$ $3$ $1$ $6$
$P_3$ $1$ $3$ $1$ $2$ $1$ $4$ $2$ $4$
$P_4$ $1$ $4$ $3$ $2$ $3$ $6$ $6$ $5$
Answer the following questions using the banker’s algorithm:
$a$. Illustrate that the system is in a safe state by demonstrating an order in which the processes may complete.
$b$. If a request from process $P_1$ arrives for $(1, 1, 0, 0)$, can the request be granted immediately ?
$c$. If a request from process $P_4$ arrives for $(0, 0, 2, 0)$, can the request be granted immediately?
