Consider the following table of Arrival time, priority order, and burst time for the four processes P0, P1, P2, P3
| Pid | Arrival Time | Priority | Brust Time |
| P0 | 3 | 9 | 10 |
| P1 | 3 | 7 | 6 |
| P2 | 4 | 11(High) | 12 |
| P3 | 8 | 5(Low) | 8 |
Using preemptive priority scheduling, find the sum of completion times of a process P0, P2.
Enter numerical value using the virtual keypad. Round off where necessary.