Five batch jobs. A through E, arrive at a computer center at almost the same time. They have estimated running times of 14, 8, 2, 4, and 10 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. Ignore process switching overhead. (a) First-come, first-served (run in order A, B, C, D, E). Assume that only one job runs at a time, until it finishes. All jobs are completely CPU bound. Answer: (b) Shortest job first. Assume that only one job runs at a time, until it finishes. All jobs are completely CPU bound. Answer: (c) Priority scheduling Assume that only one job runs at a time, until it finishes. All jobs are completely CPU bound. Answer: (d) Round robin Assume that the system is multi-programmed, and that each job gets its fair share of the CPU. Answer: (e) For part (d) Round-Robin, show your work in details. ! ** 1 A B 1