The resource usage situation for a system is given below:

Process	Current Allocation			Outstanding Requests			Resources Available
	R1	R2	R3	R1	R2	R3	R1	R2	R3
P1	1	1	0	1	0	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

1. Draw the resource allocation graph, including current allocation and outstanding requests.

2. 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?

3. Find a single request of a single resource by a single process that will deadlock this system.