Question $1(40$ pts$)$:

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

$\backslash$table$[[$burst time given in minst Time,Arrival Time,Priority,$],[$Process$,$Burst,$0,4],[$P$2,8,2,5],[$P$3,4,1,2],[$P$4,7,4,2],[$P$5,2,3,3]]$

Draw five Gantt charts illustrating the execution of these processes using FCFS$,$ SJF $($preemptive$,$ nonpreemptive$),$ a preemptive priority $($a higher priority number implies a higher priority$),$ and RR $($quantum$=1,$ quantum$=3)$ scheduling.

What is the turnaround time of each process for each of the scheduling algorithms in part $1?$

What is the waiting time of each process for each of scheduling algorithms in part $1?$

Which of the schedules in part $1$ results in the minimal average waiting time $($over all processes$)?$