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
Process
|
Arrival Time
|
Burst Time
|
Priority
|
P1
|
0
|
11
|
2
|
P2
|
5
|
28
|
0
|
P3
|
12
|
2
|
3
|
P4
|
2
|
10
|
1
|
P5
|
9
|
16
|
4
|
The average waiting time (in milliseconds) of all the processes using pre-emptive priority scheduling algorithm is ______.