T2 T3 2. Consider the order-requirement digraph with T: times given in minutes. a) With two processors, an optimal solution for this job will take at least minutes. With three processors, an optimal T45 solution for this job will take at least minutes Tg b) How many possible priority lists are there? TO c) Find the priority list that would be used in critical-path scheduling. d) Apply critical-path scheduling to construct a schedule using two processors. How does this schedule compare to the one you found in Worksheet 3.1? T 5 T2 T. 3 T3 2 Ty 7 T2 T3 2. Consider the order-requirement digraph with T: times given in minutes. a) With two processors, an optimal solution for this job will take at least minutes. With three processors, an optimal T45 solution for this job will take at least minutes Tg b) How many possible priority lists are there? TO c) Find the priority list that would be used in critical-path scheduling. d) Apply critical-path scheduling to construct a schedule using two processors. How does this schedule compare to the one you found in Worksheet 3.1? T 5 T2 T. 3 T3 2 Ty 7