Four jobs have uniformly distributed processing times, independently distributed on [10,15],[15,20],[10,20], and [15,25] respectively. There are three identical processors. Whenever a processor completes a job, it gets the next job on the schedule.

(a) Calculate the expected makespan for the schedule 1,2,3,4.(b) Calculate the expected flowtime for the schedule 1,2,3,4.(c) Calculate the expected makespan for the schedule 4,1,2,3.(d) Calculate the expected flowtime for the schedule 4,1,2,3.(e) Which schedule is better for flowtime? for makespan?