Python is prefered for this answer please

Ex. 11.35 Dynamic progi Let Charl ..n) be an array of n characters longest sequeno em is Find the longest sequence of characters S where there isa same as S (and in the same sa Subse not necessarily consecutive characters in Char that are the there is a subsequence of not necessarily consecutive characters in Char that are the sam der) and1 S (and in the same order). The two subsequences in Char do not have to be the same recursive specification that computes the length of such a longest look both ways subse data Char 1..) a) The look both ways problem is: same as the reverse the same. As wite b Find the longest subsequence of not necessarily consecutive characters in Char th palindrome is a sequence S that is the same as its reverse. For example, the f palindrome, as is the 21-letter phrase A man, a plan, a canal, Panama. (it is customary to i ignore spax write a recursive so punctuation, and capitalization when declaring phrases palindromes,) As always, you are to specification that computes the length of the solution. d In what ways are a and b different problems d) Present a sequence X of five characters (with three difrent letters) that contains a string S and Serned Ex. eversed Let