Agorithm ChangeMaking(D)(I..min, in)()/(()/())
Input: An antriv of mo clements reqnesuntimg the cain valios an hand, consisting of()/(()/())
Output: The minimum number of coins whosevalues sum to n.
F[0]larr0
for: 1-1 ton do
temp 5= MAXINT
jlarr1
while j?=m and i?=D[i] do
temp , tempF[B]larr temp +1