A system adopts a priority-based preemptive scheduling where the initial priority of a process increases by 1 after every 5 ms. In a recorded time span, the system has four processes, P1, P2, P3 and P4, as shown in the following table: INITIAL PRIORITY PROCESS ID ARRIVAL TIME IN MS 0 TOTAL CPU TIME IN MS 15 7.5 P1 P2 P3 P4 10 15 2 10 Draw a timing diagram similar to Figure 3.7 and find the turnaround time for each process. Assume that the dispatcher takes 2.5 milliseconds for a process switch Process A Process B Process C 10 20 35 Running Ready Blocked Figure 3.7 Process States for the Trace of Figure 3.4