Given a string, you have to find the minimum number of characters to be inserted in the string so that the string becomes a palindrome. Which of the following methods can be used to solve the problem?

• A. greedy algorithm
• B. recursion
• C. dynamic programming
• D. both recursion and dynamic programming