. suppose that instead of always selecting the first activity to finish, we instead select the last activity to start that is compatible with all previously selected activities. (ex. 16.1-2) a) describe how this approach is a greedy algorithm [3 points] b) prove that it yields an optimal solution [2 points]