$($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:

Incorrect

$($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:

In$$

$($c$)$ Does either algorithm give rise to an optimal schedule?

Neither algorithm gives 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.