A system has four processes and five different types of resources. The

current allocation and maximum needs are follows:

Allocated

Process A $100211$

Process B $20111$

Process C $11010$

Process D $111110$

Maximum

$11213$

The available resources after allocation are

Available $=\left[\begin{array}{ccccc}0& 1& 2& 1& 2\end{array}\right].$ What is the largest

possible value of $x$ so that ADBC is a saf

sequence? In order to get credits, you should

$2211$

show your work clearly!

$21310$

$11221$