Five jobs A through E, arrive at a computer center at almost the same time, time 0, in the order A, B, C, D, E. They have estimated burst times of 10, 1, 2, 1, and 5 minutes and their (externally determined) priorities are 3, 1, 3, 4, and 2, respectively. a. Show, using Gantt Charts, the execution of these jobs using First come first serve, Shortest Job First, a non-preemptive priority scheduling (a smaller priority number indicates a higher priority), and round-robin (quantum = 1) scheduling. b. For each of the scheduling algorithms, compute the turnaround time C. For each of the scheduling algorithms, calculate the waiting time d. Which of these scheduling algorithms has the best average waiting time (of all the jobs)