You are given infinite coins of denominations v1, v2, v3, ..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. This problem can be solved using ____________

• A. Greedy algorithm
• B. Dynamic programming
• C. Divide and conquer
• D. Backtracking