Operating Systems $-$ Assignment $-2$

Consider the following snapshot of a system:

$\backslash$table$[[,$Allocation,Max$],[,$ABCD,ABCD$],[P_0,3014,5117],[P_1,2210,3211],[P_2,3121,3321],[P_3,0510,4512],[P_4,4212,6325]]$

Using the banker's algorithm, determine whether or not each of the following states is unsafe. If the state is safe, illustrate the order in which the processes may complete.

a$.$ Available $=(0,3,0,1)$

b$.$ Available $=(1,0,0,2)$

Note That; If a safe sequence exists, BOTH the correct safe sequence AND the derivation steps are required.