Step 1: Making use of the order-requirement digraph below, determine at time 0 which tasks are ready. 4 10 15 2 3 4 6 8 20 Choose all the tasks that are ready at time O from the list below.) 1. T1 2. T2 3. T3 4. T4 5. T5 6. T6 7.None of the above. Step 2: What is special about tasks T1 and T6? T. 4 10 15 T2 3 4 T5 8 20 All the tasks require that T1 and T6 be done before these other tasks can begin No tasks require that T1 and To be done before these other tasks can begin Continue Step 6: Schedule the tasks on three processors using the priority list T6, . . . , T1. T. 10 15 T2 T. 5 3 4 T. T. 6 8 20 Fill in the blanks below and give your answers as whole numbers.) Processor 1: T idle from (2)to (3) Processor 2: TT T6 Processor 3: T(8)idle fromto (10_. Step 8: Can you find a priority list that yields an optimal schedule? T. 15 10 4 T. 2 3 4 5 T. T. 20 3 6 8 (Choose the optimal schedule from the list below.) 1, T2, T3, T4, T5, 16