This problem studies scheduling anomalies. Consider the task precedence graph depicted in Figure below with eight tasks. In the figure, ei denotes the execution time of task i. Assume task i has higher priority than task j if i

(a) Consider scheduling these tasks on two processors. Draw the schedule for these tasks and report the makespan.

(b) Now consider scheduling these tasks on three processors. Draw the schedule for these tasks and report the makespan. Is the makespan bigger or smaller than that in part (a) above?

(c) Now consider the case when the execution time of each task is reduced by 1 time unit. Consider scheduling these tasks on two processors. Draw the schedule for these tasks and report the makespan. Is the makespan bigger or smaller than that in part (a) above?

e= 1 e,= 2(2 7 e 23 4 6 e= 1 e,= 2(2 7 e 23 4 6