Develop a recursive method to determine the number of distinct ways in which a given amount of money in cents can be changed into quarters, dimes, nickels, and pennies. Each line of input contains an amount. For example, if the amount is 17 cents, then there are six ways to make change 1 dime, 1 nickel, and 2 pennies 1 dime, and 7 pennies 3 nickels and 2 pennies 2 nickels and 7 pennies
OR
OR