Try this exercise. Click the correct answer from the options.
Which of the following best describes dynamic programming?
a) A method for solving optimization problems by breaking them down into overlapping subproblems and storing the solution to each subproblem for future use. b) A programming paradigm that uses dynamic typing to enhance code flexibility and allow for late binding. c) A technique for solving problems by iteratively searching through all possible solutions. d) A strategy for solving problems by utilizing recursion and memoization.
