Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority A 2 4 B 7 2 C 1 3 D 5 1 E 3 3 The processes are assumed to have arrived in the order A, B, C, D, E all at time 0. a) Draw 4 Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, non-preemptive priority (a smaller priority number implies a higher priority), and RR (quantum = 1). b) What is the turnaround time for each process for each of the scheduling algorithms in part a? c) What is the waiting time for each process for each of the scheduling algorithms in part a? d) What is the average waiting time for each scheduling algorithm in part a), and which of the algorithms results in the minimum average waiting time (over all processes)