$15\mathrm{.}1-2$

Suppose that instead of always selecting the $$rst activity to $$nish$,$ you instead

select the last activity to start that is compatible with all previously selected activities. Describe how this approach is a greedy algorithm, and prove that it yields an

optimal solution