2. (15 points) The resource usage situation for a system is given below: Process Current Allocation Resources Available Outstanding Requests R1 R2 R3 1 0 0 R1 R2 R3 R1 R2 R3 P1 1 1 0 0 1 0 P2 1 1 0 1 0 1 P3 1 0 1 0 2 2 P4 0 1 2 0 1 0 a) Draw the resource allocation graph, including current allocation and outstanding requests. b) Find the reduced graph and show that the system is not deadlocked. Give the sequence in which requests will be granted and processes be terminated? c) Find a single request of a single resource by a single process that will deadlock this system