I need help with the following problem, i have the answer to the first part but need help with the bolded text part of the question.
Suppose you are a simple shopkeeper living in a country with n different types of coins, with values 1 = c Show that there is a set of coin values for which the greedy algorithm does not always give the smallest number of coins.
Give an example of the coin values for which it does not give an optinal solution and explain why this occured
First part answer: Consider coin values c = 1, c = 4, and c = 5. To give change for eight, the greedy algorithm uses four coins: 5,1,1,1. But, it is possible to give change for eight with two coins 4, 4.
Give an example of the of the coin values for which it does not give an optimal solution and explain why this occured is meant the be the bolded part