Problem $3$: 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 threads may complete. Otherwise, illustrate why the state is

unsafe.

a$.$ Available $=(0,3,0,1).$ What is the content of the matrix Need?

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

c$.$ If a request from thread $T_1$ arrives for $(2,1,0,3),$ can the request be granted immediately if the

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