Consider the following set of processes, with the length of the cpu burst time given in milliseconds: process burst time priority p1 2 2 p2 1 1 p3 8 4 p4 4 2 p5 5 3 the processes are assumed to have arrived in the order p1, p2, p3, p4, p5, all at time 0.

a. draw four gantt charts that illustrate the execution of these processes using the following scheduling algorithms: fcfs, sjf, non preemptive priority (a larger priority number implies a higher priority), and rr (quantum = 2).

b. what is the turnaround time of each process for each of the scheduling algorithms in part a?

c. what is the waiting time of each process for each of these scheduling algorithms?

d. which of the algorithms results in the minimum average waiting time (over all processes)?