2. Consider the directed resource graph given below. (R1-2 means Resource 1 has 2 units of non-sharable resource.) a. b. c. Is this system, as a whole, deadlocked? Are there any deadlocked processes? Three processes are requesting resources from R2. i. Which requests would you satisfy to minimize the number of processes involved in the deadlock? Which requests would you satisfy to maximize the number of processes involved in deadlock? ii. Can the graph be reduced partially or totally? Can the deadlock be resolved without selecting a victim? d. e. P1 R1-2 R2-2 P3 P2 R3-1 R4-1 P4