Question 2: Use the list-processing algorithm to schedule the tasks in the accompanying order-requirement digraph on (a) two processors using the list T1,T2,T3,T4,T,T6,T7. (1 mark) (b) Is the schedule that you obtain optimal? (1 mark) (c) Will adding a third processor enable the tasks to be finished earlier? (1 mark) (d) Which tasks in this order-requirement digraph can be shortened and not affect the completion time of all the tasks? (1 mark)