Given a string x$=$x$1$x$2$x$3....$xn of lenght n$,$ design a synamic programming that find the minimum number of characters to be inserted to make the string x a palindrome. A palindrome is a sequence of characters which reads the same backward as foreward$($KABAK$,$ ABBA...$)$ a$)$Define subproblem b$)$construct the recurrence relation c$)$determine the base cases