$3.[20$ points$]$ Deadlocks

Consider the following snapshot of a system:

Allocation Max Available

A B C D A B C D A B C D

P$0001200121520$

P$110001750$

P$213542356$

P$306320652$

P$400140656$

Please answer the following questions using Banker$$s algorithm:

$1)(5$ points$)$ What is the content of the matrix Need denoting the number of resources needed by each process?

$2)(5$ points$)$ Is the system in a safe state? Why?

$3)(5$ points$)$ If a request from process P$1$ arrives for $(0,4,2,0),$ can the request be granted immediately? Why?

$4)(5$ points$)$ If a request from process P$4$ arrives for $(0,5,2,0),$ can the request be granted immediately? Why?$[20$ points$]$ Deadlocks

Consider the following snapshot of a system:

$\backslash$table$[[,$Allocation,Max,Available$],[,$A$,$B$,$C$,$D$,,$A$,$B$,$C$,$D$,,$A$,$B$,$C$,$D$,],[$P$0,0,0,1,2,,0,0,1,2,,1,5,2,0,],[$P$1,1,0,0,0,,1,7,5,0,,,,,,],[$P$2,1,3,5,4,,2,3,5,6,,,,,,],[$P$3,0,6,3,2,,0,6,5,2,,,,,,],[$P$4,0,0,1,4,,0,6,5,6,,,,,,]]$

Please answer the following questions using Banker's algorithm:

$(5$ points$)$ What is the content of the matrix Need denoting the number of resources needed by each process?

$(5$ points$)$ Is the system in a safe state? Why?

$(5$ points$)$ If a request from process $P1$ arrives for $(0,4,2,0),$ can the request be granted immediately? Why?

$(5$ points$)$ If a request from process $P4$ arrives for $(0,5,2,0),$ can the request be granted immediately? Why?