Fiven the following information on the arrival and burst time of four processes, $P_1,P_2,P_3$ and $P_4.$

$\backslash$table$[[$Process$,$Arrival Time Bursctime,,$],[P_1,,0\mathrm{.}0,1],[P_2,1\mathrm{.}0,9,],[P_3,2\mathrm{.}0,1,],[P_4,3\mathrm{.}0,9,]]$

A$.$ What is the average waiting time using the non$-$preemptive version of the Shortest Job First?

B$.$ What is the average walting time and the average tumaround time using the Round Robin algorithm with quantum time equals to $9?$