Recall the coin change problem $-$ using a set of denomination, we try to use greedy to pay a change amount using a minimum number of coins. We know from the lecture, some denominatios work, some do not. For example, greedy algorithm works for the set of denominations $100,25,10,5,1$ cents. From the following options chose the correct one. $($There is only one correct answer$).$

a$.$ Greedy works for $100,4,3,1.$

$$ b$.$ Greedy woorks for $100,25,10,1.$

$$ c$.$ Greedy works for both denominations.

O d$.$ Greedy does not work for any of the given denominations.