For part a, almost any example will work - smaller examples than the ones provided are possible. The example in the slide before the activity also works. A better way to handle this activity might have been for the instructor to make the point that the example on the previous slide shows the original greedy algorithm doesn't work, and ask the students if the highest value greedy algorithm works.
