Given the following problem and algorithm, which technique is being implement

Problem: Given an integer amount of money, you have to determinate which is the

minimum amount of coins needed to arrive at the exact total. You have an infinite nur

of each, and may choose more than one. Coins available are $$1,$$$5,$$$10,$$$25.$

Algorithm: Choose the highest$-$value coin available that$-$does not ex

the total and repeat until you arrive at the desired amount.$$

A$)$ No technique is actually being used

B$)$ Divide and Conquer

C$)$ Greedy

D$)$ Backtracking

E$.$ Modular Programming