QUESTION $3$

$(35$ MARKS$)$

Consider the following set of processes, with the length of the CPU burst time given in milliseconds:

$\backslash$table$[[$Process$,$Burst Time,Priority$],[$P $1,2,2],[$P $2,1,1],[$P $3,8,4],[$P $4,4,2],[$P $5,5,3]]$

The processes are assumed to have arrived in the order P$1,$ P$2,$ P$3,$ P$4,$ P$5,$ all at time $0.$

a$.$ Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS$,$ SJF$,$ non$-$preemptive priority $($a larger priority number implies a higher priority$),$ and $RR($quantum $=2).$

$[20$ marks$]$

b$.$ What is the turnaround time of each process for each of the scheduling algorithms in part a$?$

$[5$ marks$]$

c$.$ Calculate the average turnaround time for each Job.

$[10$ marks$]$