In the exchange lemma for the scheduling problem, we say that the first event to finish a* in a given time period [i,j] is always part of the optimal solution for that same time period. To argue this, we say that if some optimal solution S does not contain a*, but instead begins with activity a, we can instead construct a new solution S'S {a} {a*} = Why is S' an optimal solution?