Question $7.(3$ points$)$

Consider the following snapshot of a system:

Answer the following questions using the banker's algorithm:

a$.$ What is the content of the matrix Need?

Maximum Demand

A B C D

T$05117$

T$13211$

T$23321$

T$34612$

T$46325$

Current Allocation

A B C D

T$03014$

T$12210$

T$23121$

T$30510$

T$44212$

Maximum Demand

A B C D

T$00012$

T$11750$

T$22356$

T$30652$

T$40656$

Current Allocation

A B C D

T$00012$

T$11000$

T$21354$

T$30632$

T$40014$

Available

A B C D

$1520$

$3$

b$.$ Is the system in a safe state? If yes, illustrate the order in which the threads

may complete. Otherwise, illustrate why the state is unsafe.

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

immediately?

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

immediately?