Question: 2. Does the greedy algorithm always give an optimal solution in the sys- tem of denominations d(1) = 1, d(2)-7, d(3) 10? Justify your answer.

2. Does the greedy algorithm always give an optimal solution in the sys- tem of denominations d(1) = 1, d(2)-7, d(3) 10? Justify your answer. (If you say yes, prove it; if you say no, give a counter example to show that the greedy algorithm does not give an optimal solution.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
