For 77 cents, the best combination would be the smallest of the above three
choices. The same logic applies to 76 cents (best of 75, 73, or 69 cents), and
so on (fig. 6.1). If bestNumCoinsM is the smallest number of coins needed to
change M cents, then the following recurrence relation holds: