$11\mathrm{.}1$ Given the current system state where R$1,$ R$2,$ R$3,$ and R$4$ are resources$11\mathrm{.}1$ Given the current system state where R$1,$ R$2,$ R$3,$ and R$4$ are resources

while $P1,P2,$ and $P3$ are processes.

Please draw resource$-$allocation graph and check whether there is

a cycle.

If you solve this question in Java, you get $20$ additional points.

If the graph contains a cycle, clearly indicate which processes and

resources are involved in the cycle.

Please check if the system is deadlocked. Is there any process

which can be finished? If yes, which process?

$11\mathrm{.}2$ Consider the traffic deadlock depicted in Figure $1.$

Show that the four necessary conditions for deadlock hold in this

example.

State a simple rule for avoiding deadlocks in this system.

while $P1,P2,$ and $P3$ are processes.

Please draw resource$-$allocation graph and check whether there is

a cycle.

If you solve this question in Java, you get $20$ additional points.

If the graph contains a cycle, clearly indicate which processes and

resources are involved in the cycle.

Please check if the system is deadlocked. Is there any process

which can be finished? If yes, which process?

$11\mathrm{.}2$ Consider the traffic deadlock depicted in Figure $1.$

Show that the four necessary conditions for deadlock hold in this

example.

State a simple rule for avoiding deadlocks in this system.