please look at the set 4

Five batch jobs. A through E, arrive at a computer center at almost the same time. They have estimated running times of T1, T2, T3, T4, and T5 minutes. Their (externally determined) priorities are PO, P1, P2, P3, and P4, respectively, with 5 being the highest priority. For each of the following scheduling algorithms, determine the mean process turnaround time. Ignore process switching overhead. (a) Round robin. (b) Priority scheduling. (c) First-come, first-served (run in order A, B, C, D, E). (d) Shortest job first. For (a), assume that the system is multiprogrammed, and that each job gets its fair share of the CPU. For (b) through (d), assume that only one job at a time runs, until it finishes. All jobs are completely CPU bound. Show your work! Set 4: Times: 2, 5, 8, 3, 9 Priorities: 5, 1, 4, 2, 3