Hi,

Can I get help to solve this problem? (Operating System)

A system composed of four processes, {P1, P2, P3, P4}, and three types of reusable resources, {R1, R2, R3}. The number of units of the resources are C=<3, 2, 2> respectfully. Current process states are as follows:

Process P1 holds one unit of R1 and requests one unit of R2.

Process P2 holds two unit of R2 and requests one unit of each of R1 and R3.

Process P3 holds one unit of R1 and requests one unit of R2.

Process P4 holds two unit of R3 and requests one unit of R1.

a) Show the resource allocation graph to represent current this system (1 points)

b) Is this system in deadlocked? Why/Why not

Consider the following snapshot of a system:

Allocation Max Available

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

P0 2 0 0 1 4 2 1 2 3 3 2 1

P1 3 1 2 1 5 2 5 2

P2 2 1 0 3 2 3 1 6

P3 1 3 1 2 1 4 2 4

P4 1 4 3 2 3 6 6 5

Answer the following questions using the bankers algorithm

a) What is the content of the matrix Need?

b) Is the system in a safe state?

c) If a request from process P2 arrives for (1,1,0,1), can the request be granted immediately?