Show that the greedy approach always finds an optimal solution for the Change problem when the coins are in the denominations d$0,$ d$1,$ d$2,,...,$di for some integers i$>0$ and d$>0$