Question: a program using java Given an infinite number of dollars ($1 coins), quarters (25 cents), dimes (10 cents), nickels (5 cents) and pennies (1 cent),

a program using java
Given an infinite number of dollars ($1 coins), quarters (25 cents), dimes (10 cents), nickels (5 cents) and pennies (1 cent), write code to calculate the number of ways of representing n cents using minimum number of coins. Note that n can have any finite value
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
