A word over alphabet A-Z is a palindrome if it reads same in forward or the backward direction. E.g. BOB is a palindrom but DOG is not a palindrome. Give a dynamic programming based efficient algorithm to find the longest palindrome subsequence of given word w. (A subsequence need not consist of contiguous letters E.g. MODEM has palindrome subseqeunces MDM, MOM, MEM etc.) First formulate the recursive substructure of the problem. Then give an efficient algorithm to solve the problem and estimate its time complexity. (Hint: You can use a variation of the longest common subsequence.)