PLEASE BE DESCRIPTIVE AND COMPREHENSIVE AND AVOID SHORT AND AMBIGUOUS ANSWERS.

Consider the following set of processes, with the length of the CPU burst given in milliseconds $(60$ points$)$:

The processes are assumed to have arrived in the order $P1,P2,P3,P4,P5,$ all at time $0.$

a$.$ Draw Gantt charts that illustrate the execution of these processes using the following scheduling algorithms:

FCFS$,$ SJF$,$ non$-$preemptive priority $($a smaller priority number implies a higher priority$),$ and $RR($quantum $=$

$.$

b$.$ What is the waiting time of each process and average waiting time for each of these scheduling algorithms?

c$.$ Which of the algorithms results in the minimum average waiting time $($over all processes$)?$