The weighted Activity Selection problem with weights in the set

The weighted Activity Selection problem with weights in the set {1, 2} can be solved optimally by the same greedy algorithm used for the unweighted case. ~@[](2)

答案：FALSE