Let S be the set of activities in Activity Selection Problem. T

Let S be the set of activities in Activity Selection Problem. Then there must be some maximum-size subset of mutually compatible activities of S that includes the earliest finish activity $$a_m$$. ~@[](1)

答案：TRUE