Please try to answer all questions, cause this is very related questions. Thanks in advance

(20 points) Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: Process Computation (Burst) Time Deadline Priority pe p1 p2 p3 p4 14 20 10 25 5 15 2 6 1 (highest) The processes are assumed to have arrived in the order pe, pl, p2, p3, p4, all at time e. (a) Draw five Gantt charts illustrating the execution of these processes using FCFS, ED, SPF, a nonpreemptive priority (a smaller priority number implies higher priority), and RR (quantum 1) scheduling. (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 the scheduling algorithms in part a? d) which of the schedules in part a results in the minimal waiting time (over all processes)