Q$\mathrm{.}1)$Q$\mathrm{.}1)$

Consider a system with $6$ processes P$1,$ P$2,$ P$3,$ P$4,$ P$5$ and P$6$ who are requesting for $4$ resource types $-$ A$,$

$B,C$ and $D$ at the same time. The following snapshot of the system has been given at the moment.

A$)$ Compute the Need Matrix for the above data.

B$)$

Is the system in a safe state? Why? If yes, show the safe sequence. Kindly show each and every step of

your solution

$(8$ points$)$

C$)$

Now, if a request from process P$2$ arrives for $(1,1,0,1),$ should the request be granted immediately? Why

or Why not? Kindly show each and every step of your solution.

$[8$ points$]$

Consider a system with $6$ processes P$1,$ P$2,$ P$3,$ P$4,$ P$5$ and P$6$ who are requesting for $4$ resource types $$ A$,$

B$,$ C and D at the same time. The following snapshot of the system has been given at the moment.

Process Maximum Allocation Available

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

P$1421220013321$

P$252523121$

P$323162103$

P$414241312$

P$536651432$

P$642351022$

A$)$ Compute the Need Matrix for the above data. $(4$ points$)$

B$)$

Is the system in a safe state? Why? If yes, show the safe sequence. Kindly show each and every step of

your solution $(8$ points$)$

C$)$

Now, if a request from process P$2$ arrives for $(1,1,0,1),$ should the request be granted immediately? Why

or Why not? Kindly show each and every step of your solution. $(8$ points$)$

$*************************************************************************************$