2. Step 1: Consider the following order-requirement digraph: T. 12 T2 12 9 8 T. 7 10 12 6 Find the length of the critical path. (Fill in the blank below and give your answer as a whole number.) The critica pa has length Step 2: Schedule these seven tasks on two processors using the list algorithm and the lists: (i) T1, T2, T3, Ta, T5, T6, T7 (ii) T2, T1, T3, T6, T5, T4, T7 (Choose two processors for each list from the list below.) 1. Processor 1: T1, T3, T4, T5 Processor 2: T2, T7, idle 34 to 43 2. Processor 1: T1, T3, Ts, idle 30 to 44 Processor 2: T2, T4, T6, T7 . Processor 1: T2, Ta, T6, T, idle 32 to 42 Processor 2: T1, T3, Ts, idle 37 to 43 4. Processor 1: T1, T2, T3, idle 30 to 44 Processor 2: T4, T5, T6, T7, idle 36 to 38 5. Processor 1: T1, T2, idle 31 to 40 Processor 2: T3, T4, T5, T6, T7 6. Processor 1: T2,T5, T6, T7 Processor 2: T1, T3, T4, idle 33 to 41 Enter the number(s) of the choice(s) you wish to select. Separate multiple selections with commas or semicolons. Your selections inue Step 3: In the question above you scheduled these seven tasks on two processors using the list algorithm and the lists: (i) T1, T2, T3, . T5' T6, T7 (ii) T2, T1, T3, T6. Ts, T4, T Does either list lead to a completion time that equals the length of the critical path? O No O Yes Step 4: Show that no list can ever lead to a completion time equal to the length of the critical path (providing the schedule uses two processors) (Fill in the blank below and give your answer as a whole number.) No schedule can finish earlier than time