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

milliseconds:

a$.$ Gantt charts that illustrate the execution of these processes using the

following scheduling algorithms:

Nonprimitive Priority $($a smaller priority number implies a higher priority$)$

Primitive SJF

b$.$ What is the waiting time of each process for each of the scheduling

algorithms in part a$?$

c$.$ What is the turnaround time of $($P$1$ and P$3)$ for each of the scheduling

algorithms in part a$?$

d$.$ Which of the algorithms in part a result in the minimum average waiting time

$($over all processes$)$