Consider the following snapshot of a system:

Allocation Max Need

A B C D A B C D

P$030145117$

P$122103211$

P$231213321$

P$305104612$

P$442126325$

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. Otherwise, illustrate why the state is unsafe.

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

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