Not just any greedy approach to the activity-selection problem produces a maximum-size set of mutually compatible activities. Give examples to show that each of the following approaches does not work. Give your answers using something like the following format:

(a) Select the activity of least duration from among those that are compatible with previously selected activities.

(b) Select the compatible remaining activity with the earliest start time.

-I