4 points (Rosen 3.1.58) Show that a greedy algorithm that schedules talks in a lecture hall, as described in Example 7 (Section 3.1 of Rosen's Text), by selecting at each step the talk that overlaps the fewest other talks, does not always produce an optimal schedule