Consider $5$ processes whose Arrival time and CPU Burst time is as follows $($Process no: Arrival time :

Burst time$)$:

$P1$: $0,3$

$P22,3$

$3$:$3,2$

$P4$: $5,5$

$P5$ :$6,9$

Assume that the processes are scheduled using Round Robin $($RR$)$ scheduling algorithm with time quantum $3.$ The average waiting and turnaround time is

$3\mathrm{.}80,8\mathrm{.}00$

$3\mathrm{.}40,7\mathrm{.}80$

$3\mathrm{.}60,7\mathrm{.}60$

$3\mathrm{.}20,8\mathrm{.}20$