Implement the algorithm above using a c++ program

ALGORITHM 6 Greedy Change-Making Algorithm. procedure change(ci, c cr: values of denominations of coins, where C1 > C2> .. > cr; n: a positive integer) for i:= 1 to r di := 0 {d; counts the coins of denomination ci used) di := di + 1 { add a coin of denomination ch {d, is the number of coins of denomination ci in the change for i while n ci cil n:= n-ci 1, 2, . . . , r}