Consider a post office that sells stamps in 2 different denominations, 1c and 10c. Your task is to determine the minimum number of stamps necessary for a postage value of n cents (n is integer). the most appropriate algorithm/problem that is likely to be the basis of the most efficient correc solution to the above problem from the following options is Select one: O a. longest common subsequence O b. minimum spanning tree O c.01 knapsack O d. breadth first search