in python please

#RQ4 # A set of coins makes change for n if the sum of the values of the coins is n. # For example, if you have 1-cent, 2-cent and 4-cent coins, the following sets make change for 7: # # 7 1-cent coins # 5 1-cent, 1 2-cent coins # 3 1-cent, 2 2-cent coins # 3 1-cent, 1 4-cent coins # 1 1-cent, 3 2-cent coins # 1 1-cent, 1 2-cent, 1 4-cent coins # Thus there are 6 ways to make change for 7. Write a function count_change that takes a positive integer n # and a linked list of the coin denominations and returns the number of # ways to make change for n using these coins: def count_change(amount, denominations): """Returns the number of ways to make change for amount where denominations is a linked list of coins in descending sorted order. >>> denominations = link(50, link(25, link(10, link(5, link(1))))) >>> print_link(denominations) 50 25 10 5 1 >>> count_change(7, denominations) 2 >>> count_change(100, denominations) 292 >>> denominations = link(16, link(8, link(4, link(2, link(1))))) >>> print_link(denominations) 16 8 4 2 1 >>> count_change(7, denominations) 6 >>> count_change(10, denominations) 14 >>> count_change(20, denominations) 60 """ "*** YOUR CODE HERE ***" # Linked list ADT # Interface Definitions and Implementations empty = 'empty' def is_link(s): """s is a linked list if it is empty or a (first, rest) pair.""" return s == empty or (type(s) == list and len(s) == 2 and is_link(s[1])) def link(first, rest=empty): """Construct a linked list from its first element and the rest.""" assert is_link(rest), 'rest must be a linked list.' return [first, rest] def first(s): """Return the first element of a linked list s.""" assert is_link(s), 'first only applies to linked lists.' assert s != empty, 'empty linked list has no first element.' return s[0] def rest(s): """Return the rest of the elements of a linked list s.""" assert is_link(s), 'rest only applies to linked lists.' assert s != empty, 'empty linked list has no rest.' return s[1] def print_link(s): """Print elements of a linked list s. >>> s = link(1, link(2, link(3, empty))) >>> print_link(s) 1 2 3 """ line = '' while s != empty: if line: line += ' ' line += str(first(s)) s = rest(s) print(line) import doctest if __name__ == "__main__": doctest.testmod(verbose=True)

Answer rating: 100% (QA)

lets implement the countchange function in Python using the linked list structure youve provided def ... View the full answer