1. Directed graph deadlock problem:

a. Draw a directed graph model with four processes and four resources with the following conditions:

• The system is deadlocked
• All resources are currently being held
• If any of the four processes was removed there would no longer be a deadlock

b. Remove one of the processes and indicate how the deadlock will now be resolved.

c. Referring back to your original system, indicate how the deadlock could be resolved if the mutual exclusion policy was removed from the system.

d. Referring back to your original system, indicate how the deadlock could be resolved if the resource holding policy was removed from the system.

e. Referring back to your original system, indicate how the deadlock could be resolved if the no preemption policy was removed from the system.

e. Referring back to your original system, indicate how the deadlock could be resolved if the circular waitwas removed from the system.