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

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

答案：FALSE