Question $2$: Processes and Threads

$[19$ Marks$]$

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

Table$1$

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

$1$ and $4$ are the highest and lowest priorities respectively.

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 illustrating the execution of these processes using FCFS$,$ SJF$,$ a non$-$pre$-$emptive priority $($a smaller priority number implies a higher priority$),$ and RR $($quantum $=2)$ scheduling.

b$)$ What is the turnaround time of each process for the scheduling algorithm in item $($a$)?$

c$)$ What is the waiting time of each process for the scheduling algorithm in bullet $($a$)?$

$4$

$4$

d$)$ Which of the schedules in bullet $($a$)$ results in the minimal average waiting time $($overall processes$)?$

$[3]$