$\backslash$table$[[$Total Resources Available$],[$R$1,$R$2,$R$3],[8,5,3]]$

Assume that the processes have the following maximum requirements and current allocations:

$\backslash$table$[[$Thread ID$,$Current Allocation,Maximum Requirements,$],[$R$1,$R$2,$R$3,,$R$1,$R$2,$R$3],[$T$1,2,1,0,,4,1,1],[$T$2,2,0,1,,3,4,3],[$T$3,1,1,1,,5,2,1]]$

The above state is safe. Consider each of the following requests and say if they can be granted. Assume each request starts from the above safe state. Show your work by applying the Banker's algorithm.

T$3$ makes a request for additional resources: $(R1,R2,R3)=(2,0,0).$ Can the request be granted?

T$2$ makes a request for additional resources: $(R1,R2,R3)=(0,2,0).$ Can the request be granted?

T$1$ makes a request for additional resources: $(R1,R2,R3)=(0,0,1).$ Can the request be granted?