Objective: In solving this question, you be able to interpret a resource allocation graph as well as a Wait-for graph. By describing a resource allocation graph, you will see how processes can request and hold multiple resources. Understanding this is essential to follow the process order of completion and determine if deadlock is existent in the system. 1. Describe the following resource allocation graph. EX: P1 -> R1: Process P1 is requesting instance of R1. P1 2. Create a Wait for graph from the resource allocation graph 3. Determine if there is deadlock from the graph. Explain why or why not