This problem studies scheduling anomalies. Consider the task precedence graph

depicted in Figure $12\mathrm{.}16$ with eight tasks. In the figure, e$\_($i$)$ denotes the execution

time of task i$.$ Assume task i has higher priority than task j if i $$ j$.$ There is no

preemption. The tasks must be scheduled respecting all precedence constraints and

priorities. We assume that all tasks arrive at time t$=0.$

$($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?

Figure $12\mathrm{.}16$: Precedence Graph for Exercise $6.$

$($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?

The problem is from Embedded and Cyber$-$Physical Systems course and book $"$A$.$ Lee and Sanjit A$.$ Seshia, Introduction to Embedded Systems, A Cyber$-$Physical Systems Approach, Second Edition",