For each of the following resource allocation graphs, determine if the system is currently deadlocked If it is not, add the minimum number of edges to the graph needed to create deadlock. (If the system is in deadlock to begin with, don't modify the graph!) Either way, list the deadlocked processes-ie., only those processes that satisfy all 4 necessary conditions for deadlock. Po P1 Deadlocked processes: P2 P3 Po P1 Deadlocked processes P2 Ps Po R1 Deadlocked processes P2 Ps