******Operating Systems******

Determine if a deadlock situation exists for the following description of a resource-allocation graph: Let the set of processes be: P Pi, P2, P3, P4, P5, P6, P7, P8) Let the set of resource types be: R-R, R2, Rs, R4, Rs, Ro, R7, Rs, Ro, Rio; there is only one instance of each resource type. Let the set of request and assignment edges be: For complete credit, do the following: i. Draw the graph. ii, state whether or not deadlocks exist. iii. State why you believe your answer to item ii is correct