Need help with a dynamic programming problem:

Does the greedy algorithm always give an optimal solution in the sys- tem of denominations d(1)-1, d(2)-7, d(3)-10? Justify your answer. (If you say yes, prove it; if you say no, give a counter example to show that the greedy algorithm does not give an optimal solution.)