$$ \begin{array}{|l|}\hline \textbf{Allocation} \\\hline\text{Process} & \text{E} & \text{F} & \text{G} \\\hline \text{$P_0$} & \text{1} & \text{0} & \text{1} \\\hline \text{$P_1$} & \text{1} & \text{1} & \text{2}\\\hline \text{$P_2$} & \text{1} & \text{0} & \text{3}\\\hline \text{$P_3$} & \text{2} & \text{0} & \text{0}\\\hline \end{array} \begin{array}{|l|}\hline \textbf{Max} \\\hline \text{Process}& \text{E} & \text{F} & \text{G} \\\hline \text{$P_0$} & \text{4} & \text{3} & \text{1} \\\hline \text{$P_1$} & \text{2} & \text{1} & \text{4}\\\hline \text{$P_2$} & \text{1} & \text{3} & \text{3}\\\hline \text{$P_3$} & \text{5} & \text{4} & \text{1}\\\hline \end{array} \begin{array}{|l|}\hline \textbf{Need=Max-Allocation} \\\hline\text{Process}& \text{E} & \text{F} & \text{G} \\\hline \text{$P_0$} & \text{3} & \text{3} & \text{0} \\\hline \text{$P_1$} & \text{1} & \text{0} & \text{2}\\\hline \text{$P_2$} & \text{0} & \text{3} & \text{0}\\\hline \text{$P_3$} & \text{3} & \text{4} & \text{1}\\\hline \end{array}$$
Available Resource $[E,F,G] = $ $(3,3,0)$
With $(3,3,0)$ we can satisfy the request of either $P_0$ or $P_2$.
Let's assume request of $P_0$ satisfied.
After execution, it will release resources.
Available Resource $=(3,3,0) + (1,0,1) = (4,3,1)$
Give $(0,3,0)$ out of $(4,3,1)$ unit of resources to $P_2$ and $P_2$ will completes its execution.
After execution, it will release resources.
Available Resource $=(4,3,1)+(1,0,3) =(5,3,4)$
Allocate $(1,0,2)$ out of $(5,3,4)$ unit of resources to $P_1$ and $P_1$ will completes its execution.
After execution, it will release resources.
Available Resource $=(5,3,4)+(1,1,2) = (6,4,6)$
And finally, allocate resources to $P_3$.
So, we have one of the possible safe sequence: $P_0\longrightarrow P_2\longrightarrow P_1\longrightarrow P_3$
Correct Answer: $A$