Consider the following set of processes, with arrival times and the required CPU-burst times given in milliseconds.
$\begin{array}{|l|l|l|l|} \hline \textbf{Process} & \textbf{Arrival time} & \textbf{Burst Time} \\\hline \text{P1} & \text{0} & \text{4} \\\hline \text{P2} & \text{2} & \text{2} \\\hline \text{P3}& \text{3} & \text{1} \\\hline \end{array}$
What is the sequence in which the processes are completed? Assume round robin scheduling with a time quantum of $2$ milliseconds?
- $\text{P1, P2, P3}$
- $\text{P2, P1, P3}$
- $\text{P3, P2, P1}$
- $\text{P2, P3, P1}$