C++ codes please Develop a recursive function to determine the number of distinct ways in which a given amount of money in cents could be changed into quarters, dimes, nickels, and pennies. For example, if the amount is 17 cents, then there are six ways t
computer science
Description
C++ codes please Develop a recursive function to determine the number of distinct ways in which a given amount of money in cents could be changed into quarters, dimes, nickels, and pennies. For example, if the amount is 17 cents, then there are six ways to make changes. Here is the sample output: 1) 1 dime, 1 nickel, and 2 pennies 2) 1 dime and 7 pennies 3) 3 nickels, and 2 pennies 4) 2 nickels, and 7 pennies 5) 1 nickels, and 12 pennies 6) 17 pennies Here is the function interface: // precondition: denomination = 1 (for penny), 2 (for nickel), 3 (for dime), or 4 (for quarter). // // postcondition: If amount
