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

Process burst time priority

P1 5 4

P2 3 1

P3 1 2

P4 7 2

P5 4 3

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

A. Draw 4 Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, Non-preemptive priority ans RR (quantum = 2)

B. What is the turnaround time of each process in part a.

C. What is the waiting time of each process for each scheduled algorithms

D. Which of the algorithms results in the min avg waiting time overvall processes