Coin systems

Questions 1 to 5 of 7

1. 1. What does this print? ``python print(optimal_count([1, 4, 6], 8)) ``

   1342
2. 2. What does this print? ``python print(find_counterexample([1, 4, 6])) ``

   4867
3. 3. Why does greedy_count([5, 10], 3) return -1?

   Greedy takes 5 and then 10, which makes 15, so it overshoots and gives up.The function returns -1 whenever the coins are not in sorted order.No coin fits 3, so greedy gets stuck and cannot pay the amount.Three coins are needed for 3, but the set has only two coin values.
4. 4. For the coin set 1, 2, 7, 8, what is the largest amount that find_counterexample checks?

   159148
5. 5. The coin set 1, 5, 10, 25 is canonical, so greedy gives the fewest coins for every amount. Is that statement true, and why?

   True, because no counterexample exists up to the limit 25 + 10 - 1 = 34, and a counterexample would have to be below 25 + 10 = 35.False, because greedy uses 3 coins for 6 with these coins.True, because every coin value is a multiple of the coin 5.False, because the greedy rule never uses the coin 5.