- Five batch jobs, A through E, arrive at almost the same time. They have estimated running times of 12 , 7,2,5, and 9 minutes. Their (externally determined) priorities are 3,5,2,1, and 4 , respectively, with 1 being the highest priority. For each of the following scheduling algorithms, determine the mean process turnaround time and waiting time. Ignore process switching overhead. a) Round robin with quantum of 2 . b) Priority scheduling. c) First-come, first-served (run in order 12,7,2,5,9 ). d) Shortest job first. For (b) through (d), assume that only one job at a time runs, until it finishes. All jobs are completely