Just do the maths. no coding

Suppose you have coins of denominations 1, 3 and 4. You use a greedy algorithm, in which you choose the largest denomination coin which is not greater than the remaining sum. For each of the following sums, just write YES if it will produce an optimal solution or NO if it won't. For example, for the sum 200, it will produce an optimal solution. Please show the workings in your script. No marks will be given without any explanation. For 14 For 6: For 10: For 100