Q2.For a greedy algorithm to be guaranteed correct, what property must the problem have?
Q3.In the classic "activity selection" (interval scheduling) problem, what greedy strategy maximizes the number of non-overlapping activities selected?
Q4.Why does the classic coin-change "greedy always pick the largest coin" strategy fail for some coin denominations?
