Consider the following set of processes with the arrival time and length of CPU Burst time given in milli-seconds ($\mathrm{ms}$):
$\begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arrival Time} & \textbf{Burst Time} \\ \hline P_1 & 0 & 5 \\ \hline P_2 & 2 & 3 \\ \hline P_3 & 2 & 2 \\ \hline P_4 & 5 & 3 \\ \hline P_5 & 6 & 1 \\ \hline \end{array}$
Calculate the average response time for these processes with nonpreemptive priority Scheduling algorithm? Priority of the process are as follows and consider that all the processes came at zero ($0$) time. (Note low numbers represent high priority).
$\begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Burst Time} & \textbf{Priority} \\ \hline P_{1} & 5 & 3 \\
\hline P_{2} & 3 & 1 \\ \hline P_{3} & 2 & 5 \\ \hline P_{4} & 3 & 4 \\ \hline P_{5} & 1 & 2 \\ \hline
\end{array}$
- $5.6$ $\mathrm{ms}$
- $5.2$ $\mathrm{ms}$
- $4.7$ $\mathrm{ms}$
- $3.8$ $\mathrm{ms}$
