Select the correct option to test your answer: A Greedy algorithm B 2D dynamic programming C 1D dynamic programming D Divide and conquer Show Explanation & Solution Correct Answer: Option B (2D dynamic programming)