Question 01 10 In Resource Allocation Graphs Deadlocks can be described more precisely in terms of a directed graph called a system Resource allocation graph. This graph consists of a set of vertices V and a set of edges E. The set of vertices is portioned into two different types of nodes P={PO, P1... Pn}, the Set of the active processes in the system, and R={RO, R1... Rn}, the set consisting of all Resource types in the system. A directed edge from a process Pi to resource type Rj Signifies that process Pi requested an instance of Rj and is waiting for that resource. A Directed edge from Rj to Pi signifies that an instance of Rj has been allocated to Pi. We will use the following symbols in a resource allocation graph. According to this given condition explain the resource allocation graph shown below depicts the following situation or not. If yes or no elaborate them. R3 P3 : R2 P2 P3 PI R2 P4