$($b$)$ Consider the processes with given burst times as below and same arrival time as $0$ ms

$\backslash$table$[[$Process ID$,$Arrival Time,Burst Time,Priority$],[$P$1,0,5,5],[$P$2,2,5,1],[$P$3,3,5,2],[$P$4,5,5,3],[$P$5,7,5,9],[$P$6,9,5,12]]$

Assume the OS is using Round Robin scheduling algorithm with Time quantum value of $3$ ms $.$ 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. Please do not forget to consider the arrival time and the circular queue when calculating average waiting and turnaround times $($pushing the process in circular queue after the time quantum while considering the arrival 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 $=$