Consider the set of processes with arrival time $($in milliseconds$),$ CPU burst time $($in

milliseconds$),$ and priority $(0$ is the highest priority$)$ shown below. None of the processes

have I$/$O burst time.

The average waiting time $($in milliseconds$)$ of all the processes using preemptive priority

schedulina aloorithm is