I want to solve this question in the picture

But I want the solution to be on a piece of paper if possible, because I do not understand if the answer is written on the keyboard in an unorganized manner.

Consider the following snapshot of a system:

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.