Is there a deadlock? Explain your answer.

There is a deadlock.

If there is a deadlock, which are the deadlocked processes?

Suppose we decide to kill one or more deadlocked processes, so that the resources they hold can be released and given to processes that are waiting for them. Assume that we wish to kill the minimum number of processes. How many processes would you kill? Why?

Assume that the resources are ordered in such a way that R1 is smaller than R2, R2 is smaller than R3, R3 is smaller than R4, R4 is smaller than R5, R5 is smaller than R6, and R6 is smaller than R7. We also have the rule that after acquiring a resource X, a process cannot request and wait for a resource that is ordered less than X. If this rule is observed, which of the edges in the resource graph would disappear? Would there be a deadlock now? (2) Explain.

P1 R1 R2 P2 R3 P3 R4 P4 R7 R6 P5 R5