the so called coin change problem is stated as follows: given n cents, make change (for that n cents) in such a way that minimizes the number of coins. assume that available coins are penny (1 cent), nickel (5 cents), dime (10 cents), and quarter (25 cents). what is the smallest number of coins that are needed to make changes for n