Priority Scheduling algorithm $($preemptive$)-2\%$

Consider the processes with the burst and arrival times and their priorities given in part $1$ b $($considered for Round Robin algorithm$).$ Assume the OS is using preemptive priority scheduling algorithm. Calculate the waiting and turnaround times for each process. Provide the Gantt chart below to show the execution of the processes and fill in the columns in the table below for the waiting time and turnaround time.

Gantt Chart: Insert your Gantt chart below

Turnaround time and waiting time

Process ID Waiting Time Turnaround Time

P$1$

P$2$

P$3$

P$4$

P$5$

P$6$

Average waiting time $=$

Average turnaround time $=$