The task times of 12 independent tasks T1 to T12 are given, in minutes, as 5,9,8,5,3,8,3,9,8,8,1,2 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 tasks does processor #1 complete? T1 T3 T2 T5 T4 T7 T6 T9 T8 T11 T10 (b) Which tasks does processor #2 complete