Help me for those Operation System question

1. Consider a system with 10 tape disk drives and 3 processes P1, P2, and P3. The table below gives a snapshot of the system at a point in time. Formally show whether the system is in the safe state.

Process	Maximum	Current
P1	10	5
P2	4	2
P3	5	3

2.

Assume a system with 3 processes P1, P2, and P3, and resources R1, R2, and R3. Each resource has a single instance.

1. Draw a resource allocation graph for the following sequence of events:

1. 1. P1 is granted access to resource R1.
   2. P2 requests resource R1
   3. P3 requests resource R3
   4. P2 is granted access toR2
   5. P1 requests R2
2. Convert your resource allocation graph to a wait-for graph. Is there a deadlock?

3.

Consider a system with processes P1 and P2 and resources R1, R2, R3 (where each resource has a single instance). Draw a resource allocation graph for each of the following steps in the sequence and answer the following questions:

a. Process P2 requests resource R1.

b. Process P1 is granted access to R1.

c. Processes both P1 and P2 claim both resources R2 and R3.