2. A palindrome is any string that is exactly the same as its reversal, like I, or DEED, or RACECAR, or AMANAPLANACATACANALPANAMA. Describe and analyze an efficient algorithm to find the length of the longest palindrome subsequence of a given string/array A[1 . n]. For example, the longest palindrome subsequence of MAHDYNAMICPROGRAMZLETMESHOWYOUTHEM is MHYMRORMYHM. Yes, the palindrome subsequence may have odd length. Your analysis should explain how much time and space your algorithm uses