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

Let S be the set of activities in Activity Selection Problem. The greedy rule of "collecting the activity that starts the latest" is correct for finding a maximum-size subset of mutually compatible activities of S. ~@[](1)

答案：TRUE