Five processes A, B, C, D and E arrived in this order at the same time with the following CPU burst and priority values. The length of the CPU-burst time of processes is given in milliseconds. A smaller value means a higher priority. Draw Gantt charts to illustrate the execution of these jobs for each of the following CPU scheduling algorithms: Preemptive Shortest Job First; and Preemptive Priority. Make the following assumptions to handle 'ties'. In Shortest Job First, if two jobs have the same shortest time, the one with its arrival order first have to start first. Preemptive Shortest Job First Preemptive priority b. What is the average turnaround time of each of the scheduling algorithms in part a? c. What is the average waiting time of each scheduling algorithms