(40%) Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority P1 5 4 P2 P3 P4 2 Ps 3 3 1 2 1 7 4 The processes are assumed to have arrived in the order Pa, P2, P3, P4, Ps, all at time 0. a. (20%) Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpreemptive priority (a larger priority number implies a higher priority), and RR (quantum = 2). b. (8%) What is the turnaround time of each process for each of the scheduling algorithms in part a? C. (8%) What is the waiting time of each process for each of these scheduling algorithms? d. (4%) Which of the algorithms results in the minimum average waiting time (over all processes)