Question $3$: CPU Scheduling Policies $($Max Mark: $16/100)$

$($a$)$ Assume that you have the following processes all arriving at time $0$:

Process CPU Burst $($ms$)$ Nice

P$184$

P$261$

P$312$

P$492$

P$533$

For each of the following CPU scheduling algorithms, determine the average turnaround

time $(=$ finish $$ arrival time$)$ and average waiting time $($time spent waiting for execution$).$

$$ First Come First Serve

$$ Shortest Job First

$$ Preemptive Priority Scheduling

$$ Round Robin $($assume a quantum of $1$ ms$)$