Operating System , Time Limit One Hour ! URGENT

1- Scheduling (20 pts). Suppose that the following batch jobs arrive at a computer center at almost the same time and will run the listed amount of time as indicated. For each of the following scheduling algorithms, calculate the average turnaround time. Batch Jobs Running time (min) Priorities P1 16 2 P2 5 3 P3 3 1 P4 10 4 a) Priority Scheduling (with 4 being the highest priority) b) First-come, first served (assume P1 came first, then P2, then P3 and finally P4 came last for this scheduling algorithm) c) Shortest job first d) Round robin (Assume that the time quantum is 1 minute)