1. Consider the following snapshot of a system:

	Allocation				Max
	A	B	C	D	A	B	C	D
T0	1	2	0	2	4	3	1	6
T1	0	1	1	2	2	4	2	4
T2	1	2	4	0	3	6	5	1
T3	1	2	0	1	2	6	2	3
T4	1	0	0	1	3	1	1	2

Using the bankers algorithm, determine whether or not each of the following states is unsafe. If the state is safe, illustrate the order in which the threads may complete. Otherwise, illustrate why the state is unsafe.

1. Available = (2, 2, 2, 3)
2. Available = (4, 4, 1, 1)
3. Available = (3, 0, 1, 4)
4. Available = (1, 5, 2, 2)