In the Activity Selection problem, consider any non-empty set of

In the Activity Selection problem, consider any non-empty set of activities $$S$$, and let $$a_m$$ be an activity in $$S$$ with the*** latest start time.*** Then $$a_m$$ must be included in some maximum-size subset of mutually compatible activities of $$S$$. ~@[](1)

答案：TRUE