A) When the activities are are scheduled using a greedy strategy, but following the above shortest interval order, the maximum number of activities that can be scheduled is

a. 4

b. 5

c.2

d.3

B) When the activities are scheduled using a greedy strategy, but following the earliest start time order, the maximum number of activities that can be scheduled is

a. 4

b. 5

c.2

d.3

Activities A1,A2,...,A12 need to use the same resource. In the table below you can see when they start and when they finish. On a scratch paper, find the schedule that maximizes the number of activities that can be scheduled, using the greedy algorithm described in class. Activity A1 A2 A3 A4 A5 A6 AZ A8 A9 A10 A11 A12 Start 1 3 2 6 6 8 4 4 9 10 2 7 Finish 6 5 7 8 9 9 7 7 12 14 5 10