Q51

Consider the set of process with arrival time (in milliseonds), CPU burst time (in millisecods) and priority ($0$ is the highest priority) shown below. None of the process have I/O burst time

$$\small \begin{array}{|c|c|c|c|} \hline \textbf{Process} & \textbf{Arrival Time} & \textbf{Burst Time} & \textbf{Priority} \\\hline \text{$P_1$} & 0 & 11 & 2 \\\hline \text{$P_2$} & 5 & 28 & 0 \\\hline \text{$P_3$} & 12 & 2 & 3 \\\hline \text{$P_4$} & 2 & 10 & 1\\\hline \text{$P_5$} & 9 & 16 & 4 \\\hline \end{array}$$

The average waiting time (in milli seconds) of all the process using premtive priority scheduling algorithm is ______