the solution solved befor in chegg is wrong

a string x=x1x2xn of length n, design a dynamic programming that finds the palindrome is a sequence of to be inserted to make the string a palindrome. A (KABAK,ABBA,)AB of characters which reads the same backward as forward a) (5p) Define a subproblem b) (15p) Construct the recurren c) (5p) Determine the base cases