Five batch jobs, A through E arrive at the scheduler at approximately the same time. They have estimated running times of 40ms, 50ms, 90ms, 30ms and 80ms respectively. Their priorities are 2, 3, 1, 5 and 4, respectively, with 1 being the highest priority. Specify the order in which processes execute and determine the mean process turnaround time for each of the following scheduling algorithms:

a) Round robin (assume the jobs are preemptable)

b) Priority scheduling

c) First come, first serve (assume order A, B, C, D, E)

d) Shortest job first

For (a), assume each process gets a fair share of time on the CPU. For (b) through (d), assume that only one job runs at a time until finished. Ignore process switching overhead (assume it takes 0 time).