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 Sort the twelve activities in the order of fewest conflicts (in case of ties, resolve them by activity number). O A1 A3 A11 A2 A7 A8 A4 A5 A12 A6 A9 A10 A6 A2 A4 A5 A7 A8 A9 A11 A12 A10 A1 A3 O A2 A11 A1 A3 A7 A8 A4 A5 A6 A12 A9 A10 A10 A6 A9 A12 A1 A2 A4 A11 A5 A3 A7 A8 None of the above When the activities are are scheduled using a greedy strategy, but following the above sorted order, the maximum number of activities that can be scheduled is 3 2 5 4