Macmillan Learning (a) 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. Give all numeric answers as whole numbers. completion time: (b) Find the completion time for the tasks in part (a) on two processors using the decreasing-time-list algorithm. completion time on both machines: TOOLS x10 (c) Does either algorithm give rise to an optimal schedule? Yes, the algorithm in part (b) gives rise to an optimal schedule. Yes, the algorithm in part (a) gives rise to an optimal schedule. Neither algorithm gives rise to an optimal schedule. Yes, both the algorithms in parts (a) and (b) give rise to an optimal schedule. (d) Repeat for tasks of lengths 19, 19, 20, 20, 1, 1, 2, 2, 3, 3, 5, 5, 11, 11, 17, 18, 18, 17, 2, 16, 16, 2. Find the completion time for the tasks on two processors using the list-processing algorithm.