Question $1$: Banker's algorithm

Consider the following snapshot of the current state of the system:

Allocation Matrix $=\left[\begin{array}{cccc}3& 0& 1& 4\\ 2& 2& 1& 0\\ 3& 1& 2& 1\\ 0& 5& 1& 0\\ 4& 2& 1& 2\end{array}\right],$ Max Matrix $=\left[\begin{array}{cccc}5& 1& 1& 7\\ 3& 2& 1& 1\\ 3& 3& 2& 1\\ 4& 6& 1& 2\\ 6& 3& 2& 5\end{array}\right]$ and Available $=\left[\begin{array}{cccc}0& 3& 0& 1\end{array}\right]$

Using the banker's algorithm, determine whether or not the giver state is unsafe. If the state is safe, illustrate the order in which the threads may complete. Otherwise, illustrate and explain why the state is unsafe $($unsafe state implies that there is a potential of a Deadlock, whereas safe state means that deadlock cannot exist$).$