Q$3.7$ points$]$ Below is the pseudocode for the Banker's algorithm:

Resource Request Algorithm

If Request$($i$)$ Need $($i$)$ go to step $2.$ Otherwise, raise error condition since process has exceeded its maximum claim.

If Request$($i$)$ Available, go to step $3.$ Otherwise, Pi must wait since resources are not available.

Pretend to allocate requested resources to Pi by modifying the state as follows:

Available $=$ Available $-$ Request$($i$)$

Allocation$($i$)=$ Allocation$($i$)+$ Request$($i$)$

Need$($i$)=$ Need$($i$)-$ Request$($i$)$

If safe $$ the resources are allocated to $$

If unsafe $$ Pi must wait, and the old

resource$-$allocation state is restored

Safety Algorithm

Let Work and Finish be vectors of length $m$ and $n,$ respectively. Initialize:

Work $=$ Available

Finish $[i]=$ false for $i=0,1,$dots,$n-1$

Find an i such that both:

$($a$)$ Finish $[$i$]=$ false

$($b$)$ Need$($i$)$ Work

If no such i exists, go to step $4$

Work $=$ Work $+$ Allocation$($i$)$

Finish $[i]=$ true go to step $2$

If Finish $[$i$]=$ true for all $i,$ then the system is in a safe state

Based on the following snapshot of the system, answer the following questions:

$\backslash$table$[[,$Allocation,Max,Available$],[,$ABCD,ABCD,ABCD