Select the option below which best describes the dynamic programming method of finding the most profitable solution for the rod-cutting problem for rod length n.

a. You compute in a bottom-up fashion the best way to cut rods for lengths 1 (n-1). Compute the maximum using these stored smaller solutions.

b. Recursively compute the maximum cost obtained for smaller rods until you reach the base case of length 1.

c. You know from the input the best way to cut rods for lengths 1 (n-1). Compute the maximum using these known smaller solutions.

d. Compute the cost for each of the 2m solutions and find the optimal one.