Problem G: (10 Points) Determine if a deadlock situation exists for the following description of a resource-allocation graph: Let the set of processes be: P [P, P Ps, P. Ps, P%. P, Ps). 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: R10 P8 For complete credit, do the following: i. Draw the graph. ii. State whether or not deadlocks exist. ii. State why you believe your answer to item ii is correct