Consider the following system specification, where $R$ is the set of resources, $P$ is the set of processes, and $E$ is the set of edges in the resource allocation graph.

$(4$ marks$)$

$\}$

$\{P3R4,P4R1$

Assume that there is only one instance of each resource type, draw the resource allocation graph.

Question: Is the system in a deadlock state? Why?

Q$7.$ Consider a system with $13$ disk drives and $9$ tape drives and $4$ processes; $P1,P2,P3,$ and $P4.$ The following table shows the maximum number of disk and tape drives each process needs and the number of disk and tape drives each process holding currently at time $t_i.$

$(4$ marks$)$

Answer the following questions using the Banker's algorithm:

a$)$ Fill$-$in the missing information in the table $($the contents matrix Need and the Available$)$

$\backslash$table$[[$Process$,$Maximum needs,Currently holding,Need,Available$],[$Disks$,$Tapes,Disks,Tapes,Disk,Tape,Disk,Tape$],[$P$1,10,5,3,1,,,,],[P2,7,3,4,2,,,,],[P3,7,4,3,1,,,,],[$P$4,5,3,0,0,,,,]]$