Not just any greedy approach to the activity-selection problem produces a maximum- size set of mutually compatible activities. Give an example (by presenting few activities with their start and finish times) to show that the greedy strategy of selecting the activity of least duration from among those that are compatible with previously selected activities does not provide an optimal solution.