Suppose that the available coins are in the denominations that are powers of cc, i. e., the denominations are c^0, c^1, \ldots, c^kc 0 ,c 1 ,…,c k for some integers c > 1c>1 and k \ge 1k≥1. Show that the greedy algorithm always yields an optimal solution.

im alright what do you need

step-by-step explanation:

in mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. there are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. the set of candidate solutions that satisfy all constraints is called the feasible set.

hoped i'm right lol