Consider the problem of making change for $n$ cents using the fewest number of coins. An algorithm to solve this problem is to give the coin with the highest available denomination without going over, and repeat the process until the amount of remaining change drops to 0. Which of the following sets of available coin denominations would cause this algorithm to fail at yielding an optimal solution?