T/F given a set of coin denomination (1,5,10) the problem is to find minimum number of coins required to get a certain amount. the greedy algorithm is to pick the largest possible denomination.