Question 3.40

10. For the accompanying order-requirement digraph, answer the following questions.

image
  1. Find the length of the critical path(s) and which tasks are on the critical path(s).
  2. Which task(s) (taken one at a time) would not alter the length if the time of that task were to increase by 1 time unit?
  3. With two processors, can these tasks be scheduled to finish by time 20? If so, what list would enable you to apply the list-processing algorithm and finish by time 20 on two processors?