Question # 5 [5 Marks]

Consider the following snapshot of a system:

	ALLOCATION				MAX				AVAILABLE
	A	B	C	D	A	B	C	D	A	B	C	D
P0	3	2	1	4	3	4	2	7	4	4	3	1
P1	2	5	4	3	4	7	7	6
P2	3	1	1	2	5	3	2	3
P3	2	4	2	3	2	5	3	5
P4	4	2	3	2	6	3	6	3

Answer the following questions using the bankers algorithm:

1. Illustrate that the system is in a safe state by demonstrating an order in which the processes may complete.
2. If a request from process P4 arrives for (2,2,1,1), can the request be granted immediately?
3. If a request from process P1 arrives for (1,1,3,1), can the request be granted immediately?