Problem 2: A palindrome is a sequence of characters that is the same if it is reversed. For example, 'anna' is a palindrome. Suppose that you are given a sequence o whether 1t 1 of more palindromes of length 1 placed next to each other. For example, 'dadseesanna' is made of the palindromes 'dad', 'sees', and 'anna', placed next to each other. Design a dynamic programming algorithm to solve this problem. Hint: It may be useful to write a helper function to determine whether a particular string is a palindrome. f characters, and wish to determine s made of one