5.17 Consider the following set of processes, with the length of the CPU burst given in milliseconds:Process Burst Time PriorityP1 5 4P2 3 1P3 1 2P4 7 2P5 4 3The 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 pro-cesses 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 schedul-ing algorithms?
