Q$1(20)$: Describe that a multi$-$threading system is in a safe state. Consider the following snapshot of a system. Answer the following questions using the banker's algorithm. Assume the available instance $($A B

$\backslash$table$[[,$Allocation,MAX,Need$],[,$A B C D$,$A B C D$,$A B C D$],[$T$0,0012,0012,],[$T$1,1000,2750,],[$T$2,1354,2356,],[$T$3,0632,0652,],[$T$4,0014,0656,]]$

a$.$ What is the content of the Need column? Fill in the table column.

b$.$ Is the system in a safe state? Why?You may use the table to do available column analysis after each thread to reason your answer for

question b$,$ c and d$.$

c$.$ If a request from thread $T1$ arrives for $(0,4,2,0),$ can the request be granted immediately? Why?

d$.$ If a request from thread T$1$ arrives for $(1,4,2,0),$ can the request be granted immediately? Why?