For problems $1013$

Consider the following snapshot of a system:

$\backslash$table$[[,,$Illoc,tion,,,Max,,Available$],[,$A$,$B$,$C$,$D$,$A$,\frac{?}{\text{b}\text{a}\text{r}}(BC),$D$,$A B C$],[P_1,\backslash$table$[[2],[1]],\backslash$table$[[0],[0]],\backslash$table$[[3],[0]],\backslash$table$[[1],[0]],2,\backslash$table$[[0,4]],2,],[,1,3,3,4,\backslash$table$[[1],[2]],\backslash$table$[[7,5],[2,]],0,],[,0,6,3,2,0,\backslash$table$[[6,4]],3,],[,0,0,1,4,1,22,1,]]$

Answer the following questions using the banker's algorithm.

Here is the "safety" and "resource$-$request" algorithm for process i:

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

Work $=$ Available

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

Find and i such that both:

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

$($b$)$ Need ${?}_i$ Work

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

$,$ Work $=$ Work $+$ Allocation

Finish $[]$