Question 5.2. Based on the resource allocation graph, are th…
Question 5.2. Based on the resource allocation graph, are there any cycles in the graph? If yes, write down the cycles in the form of “a-b-c-a”. Does that introduce a deadlock problem for the given processes? Why? If there is no cycle, add one more request edge to create a cycle that imposes a deadlock problem and write down the cycle.