Consider the following set of processes with the length of CPU burst time in milliseconds (ms) $:$
$\begin{array}{|l|l|l|l|l|l|l|} \hline \textbf{Process} & \text{A} & \text{B} & \text{C} & \text{D} & \text{E} \\\hline \textbf{Burst time} & \text{6} &\text{1} & \text{2} & \text{1} & \text{5} \\\hline \textbf{Priority} & \text{3} & \text{1} & \text{3} & \text{4} & \text{2} \\\hline \end{array}$
Assume that processes are stored in ready queue in following order $:$
$\text{A – B – C – D – E}$
Using round robin scheduling with time slice of $1$ ms, the average turn around time is
- $8.4$ ms
- $12.4$ ms
- $9.2$ ms
- $9.4$ ms