$($a$)$ Find the completion time for independent tasks of length $8,11,17,14,16,9,2,1,18,5,3,7,6,2,$ I on two processors using

the list$-$processing algorithm.

Give all numeric answers as whole numbers.

completion tir

Incorrect Answer

$($b$)$ Find the completion time for the tasks in part $($a$)$ on two processors using the decreasing$-$lime$-$list algorithm.

completion time on both machines:

$($c$)$ Does cither algorithm give rise to an oplimal schedule?

Yes. the algorithm in part $($a$)$ gives rive to an optimal schedule.

Yes, the aleorithm in part $($b$)$ gives rise to an optimal schedule.

Neither algorithm gives rise wa an optinat schedules

Yes, bath the algorithms in parts $($a$)$ and $($b$)$ give rise: to an optimal schedule: