tion: 90 m 8 1. Given a string x = X1 X2 ... X, of length n, design a dynamic programming that finds 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 forward (KABAK, ABBA, ...) AK 1,5 AB/BA a) (5p) Define a subproblem b) (15p) Construct the recurrence relation ABB ABCD c) (5p) Determine the base cases s XL X3 KAB/