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

$P1$:$0,3$

$P2$:$2,3$

$P3$:$3,2$

$P4$:$5,5$

$P5$:$6,9$

Assume that the processes are scheduled using SJF $($Non$-$preemptive$)$ scheduling algorithm. The average waiting and turnaround time is

$2\mathrm{.}65,7\mathrm{.}00$

$2\mathrm{.}60,7\mathrm{.}05$

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

$2\mathrm{.}60,7\mathrm{.}00$