Consider a priority-based CPU scheduler that preempts a lower-priority running process when a higher-priority process enters the ready queue. Let the workload for this CPU scheduler be as follows: Process Priority Arrival Time CPU Burst
P1 3 t 5
P2 4 t+2 3
P3 5 t+4 9
P4 1 t+6 1
P5 2 t+8 7
P6 6 t+10 3
Assume that there is no activity in the system when process P1 arrives at time t. Determine the schedule of process execution, and compute the wait times and turnaround times for each of the six processes.