GATE Computer Science (CS) 2018 Shift 1 Solved Paper

In a system, there are three types of resources: $\mathit{E},\mathit{F}$ and $\mathit{G}$. Four processes ${\mathit{P}}_0,{\mathit{P}}_1,{\mathit{P}}_2$ and ${\mathit{P}}_3$ execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. For example $\mathit{M}\mathit{a}\mathit{x}\left[{\mathit{P}}_2,\mathit{F}\right]$ is the maximum number of instances of F that ${\mathit{P}}_2$ would require. The number of instances of the resources allocated to the various processes at any given state is given by a matrix named allocation.
Consider a state of the system with the Allocation matrix as shown below and in which 3 instances of $\mathit{E}$ and 3 instances of $\mathit{F}$ are the only resources available.

Allocation
	E	F	G
${\mathit{P}}_0$	1	0	1
${\mathit{P}}_1$	1	1	2
${\mathit{P}}_2$	1	0	3
${\mathit{P}}_3$	2	0	0

MAX
	E	F	G
${\mathit{P}}_0$	4	3	1
${\mathit{P}}_1$	2	1	4
${\mathit{P}}_2$	1	3	3
${\mathit{P}}_3$	5	4	1

From the perspective of deadlock avoidance, which one of the following is true?