Suppose that instead of always selecting the first activity to finish, we instead select the last activity to start that is compatible with all pre- viously selected activities. Describe how this approach is a greedy algo- rithm, and prove that it yields an optimal solution (maximum number of activities allowed).
