The task times of 12 independent tasks T1 to T12 are given, in minutes, as

2, 7, 4, 10, 10, 3, 3, 6, 11, 5, 8, 9

Use the list processing algorithm to schedule these tasks on three processors, #1, #2, and #3. The tasks are prioritized in the order written above. (a) Which of these tasks does processor #1 complete?

T1 T2 T3 T4 T5 T6 T7 T8 T9 T10 T11 T12

(b) Which of these tasks does processor #2 complete?

T1 T2 T3 T4 T5 T6 T7 T8 T9 T10 T11 T12

(c) Which of these tasks does processor #3 complete?

T1 T2 T3 T4 T5 T6 T7 T8 T9 T10 T11 T12

(d) Is the schedule optimal?

Need more information to decide, No or Yes

(e) How long is an optimal schedule for these 12 tasks? ____ minutes