(Solved) : 1 Consider Following Set Processes Length Cpu Burst Given Milliseconds Processes Assumed A Q33161626 . . . .

1.     Consider the following set ofprocesses, with the length of the CPU burst given inmilliseconds:

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

a.     Draw four Ganttcharts that illustrate the execution of these processes using thefollowing scheduling algorithms: FCFS, SJF, non-preemptive priority(a larger priority number implies a higher priority), and RR(quantum = 2).

                                                                                                           [10% marks]

b.    What is the turnaroundtime of each process for each of the scheduling algorithms in parta? What is the waiting time of each process for each of thesescheduling