The task times of 6 independent tasks T1 to T6 are iven, in minutes, as Use the decreasing-time-list algorithm to schedule these tasks on two processors, #1 and #2. Then answer the following questions (a) which tasks does processor #1 complete? 9, 8, 7,9, 2,5 (b) which tasks does processor #2 complete? (c) Is the schedule optimal? O More information is needed O Yes Use the priority list T1, T2, T3, T4, T5, T6, schedule the tasks on two processors. Then answer the following questions: (d) which tasks does processor #1 complete? (e) which tasks does processor #2 complete? (f) Is the schedule optimal? O Yes O No (g) How long is an optimal schedule for these 6 tasks? minutes