Consider the Deadlock Avoidance problem. Suppose we have four types of resources: 9 of type-A, 3 of type-B and 6 of type-C. In the current state, maximum resources are needed, and the resources allocated to each of the processes are given as the following:

(a) Calculate the need matrix and the available array.

(b) Show that the current state is safe, that is, show a safe sequence of processes.

(c) Consider that two requests are presented separately:

Req (P ₂ , [0, 0, 1]) and Req (P ₄ , [0, 1, 0]).

Can these two requests be granted?

Process P P P3 P4 Max 3 2 2 6 3 4 2 1 1 234 2 Allocation 1 0 6 1 2 1 002 0 2 1