PYTHON 3 PLEASE FOLLOW INSTRUCTIONS

COMPLETE CODE

Problem:

Given a set of coin values, we want to find the least number of coins necessary for making a given change where we have an infinite number of each coin value.

For example, if we have pennies, nickels and quarters (i.e. [1, 5, 25]), and we are asking what's the minimum number of coins needed to make a change of 62 cents, the answer is 6: two quarters, two nickels, and two pennies.

Complete the function minCoins() to return the number of minimum coins necessary to make the required change, where the set of possible coin values are given by the choices array.

Your solution must use Dynamic Programming with memoization

CODE :

def minCoins(choices, change):

minCoins([1, 5, 25], 62) # should return 6 minCoins([9, 6, 5, 1], 11) # should return 2

1 def minCoins(choices, change): 2 3 minCoins([1, 5, 25], 62) # should return 6 minCoins([9, 6, 5, 1], 11) # should return 2