$[75$pts$]$ b$)$ Consider the set of processes: $(10$ pts for each correct GANTT chart$)$

Draw the GANTT chart for the following scheduling algorithms.

First$-$Come First$-$Served $($FCFS$)$

Shortest Job First $($SJF$)($Non$-$preemptive$)$

Shortest Remaining Time First $($SRTF$)$

$,$ Round Robin $($RR$)($Time Quantum $=10)$

Priority $($Preemptive$)$

When priority is being used, a smaller priority number means higher execution priority $.$ For tie$-$breaking cases, the

process with the earlier arrival time should execute.

And complete the following table with the average waiting time and turnaround time of each algorithm $(2\mathrm{.}5$ pts for

each correct answer$)$: