Consider the problem of making change for n cents using the fewest number of coins. Assume that each coin's value is an integer. Problem 3.b. (4 points) Design an O(nk) time algorithm that makes change for any set of k different coin denomina- tions, assuming that one of the coins is a penny. Consider the problem of making change for n cents using the fewest number of coins. Assume that each coin's value is an integer. Problem 3.b. (4 points) Design an O(nk) time algorithm that makes change for any set of k different coin denomina- tions, assuming that one of the coins is a penny