2. Let T = {(1,3), (2, 4), (3,5), (2,7), (4,6), (5,6), (3,7),(5,8). (6,10), (7,9), (8, 10)} denote the (start, finish) times for a collection of 11 tasks. (a) Solve the Interval Scheduling Problem for this collection of tasks (i.e. find the maximum number of tasks that can be scheduled on a single machine, and give a set of compatible tasks that achieves this maximum) (b) Solve the Task Scheduling Problem for this collection of tasks (ie. find the minimum number of machines required to complete all tasks, and give a schedule for doing so)