Question $3$

$[12$ marks$]$

Suppose that the following processes arrive for execution at the times indicated in Table $1.$ Each process will run for the burst time listed. In answering the questions, use zon preemptive scheduling, and base all decisions on the information you have at the time the decision must be made.

$\backslash$table$[[$Table $1],[$Process$,$Arrival Time,Burst Time$],[$P$1,0\mathrm{.}0,9],[$P$2,0\mathrm{.}5,5],[$P$3,1\mathrm{.}0,2]]$

$($a$)$ What is the average turnaround time for P$1,$ P$2$ and P$3$ when the First Come First Served scheduling algorithm is used?

$($b$)$ What is the average turnaround time for P$1,$ P$2$ and P$3$ when the Shortest Job First scheduling algorithm is used?

$($c$)$ What is the average turnaround time for P$1,$ P$2$ and P$3$ when the Shortest Remaining Time First scheduling algorithm is used?

$($d$)$ What is the average turnaround time for P$1,$ P$2$ and P$3$ when the Round Robin scheduling algorithm with a time quantum $=3$ is used?