multistep question

Step 1: Find the completion time for independent tasks of length 8, 11, 17, 14, 16, 9, 2, 1, 18, 5, 3, 7, 6, 2, 1 on two processors, using the list-processing algorithm. (Fill in the blank below and give your answer as a whole number.) The completion time is eBook Step 2: Find the completion time for independent tasks of length 8, 11, 17, 14, 16, 9, 2, 1, 18, 5, 3, 7, 6, 2, 1 on two processors, using the decreasing-time-list algorithm. (Fill in the blank below and give your answer as a whole number.) The completion time is on both machines. Step 3: Does either algorithm give rise to an optimal schedule? Yes the algorithm in Step 1 (2 questions above) gives rise to an optimal schedule. Yes the algorithm in Exercise Step 2 (question directly above) gives rise to an optimal schedule. Yes both the algorithms in Steps 1 and 2 give rise to an optimal schedule. Neither algorithm gives rise to an optimal schedule. Step 4: Find the completion time for independent tasks of length 19, 19, 20, 20, 1, 1, 2, 2, 3, 3, 5, 5, 11, 11, 17, 18, 18, 17, 2, 16, 16, 2 on two processors, using the list- processing algorithm. (Fill in the blank below and give your answer as a whole number.) The completion time is Step 5: Find the completion time for independent tasks of length 19, 19, 20, 20, 1, 1, 2, 2, 3, 3, 5, 5, 11, 11, 17, 18, 18, 17, 2, 16, 16, 2 on two processors, using the decreasing-time-list algorithm. (Fill in the blank below and give your answer as a whole number.) The completion time is on both machines