Consider the following set of processes assumed to have arrived at time 0 in order P1, P2, P3, P4 and P5 with the length of CPU burst given in Milliseconds.
| Process | Burst Time | Priority |
| P1 | 10 | 3 |
| P2 | 1 | 1 |
| P3 | 2 | 4 |
| P4 | 1 | 5 |
| P5 | 5 | 2 |
What is the average waiting time (in milliseconds) using priority scheduling.