Ouestion Three [25 marksl Give an algorithm using dynamic programming to determine how many distinct ways there are to give a cents in change using any coins from among pennies, nickels, dimes, and quarters. For example, there are 6 ways to give 16 cents change: lo A dime, a nickel, and a penny; A dime and 6 pennies; 3 nickels and a penny 2 nickels and 6 pennies; . . One nickel and 11 Pennies; . And16 pennies. Demonstrate your solution by showing a step-by-step solution for 12 cents change. Rest