The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm.

Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. The scheduler will execute the highest-priority process. For processes with the same priority, a round-robin scheduler will be used with a time quantum of 10 units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue. Each process will produce some output as soon as it is scheduled.

Fill in the blanks to give the turnaround time for each process and the response time for each process. Give your answers as whole numbers.

P1 Turnaround time = ?

P2 Turnaround time = ?

P3 Turnaround time = ?

P4 Turnaround time = ?

P1 Response time = ?

P2 Response time = ?

P3 Response time = ?

P4 Response time = ?

P1 15 Process Priority Burst Arrival 18 O P2 30 10 2 P3 20 12 4 P4 25 10 10