Show that a greedy algorithm that schedules talks in a lecture hall, as described in Example 7, by selecting at each step the talk that overlaps the fewest other talks, does not always produce an optimal schedule.

“exterior angles of triangles. an exterior (or external) angle is the angle between one side of a triangle and the extension of an adjacent side. try this drag the orange dots on any vertex to reshape the triangle.” look to get to the answer i explained what it means and other things i hope it you .