Problem
1. Let T be a text string of length n. Describe an O(n)-time method for finding the longest prefix of T that is a substring of the reversal of T.
2. Describe an efficient algorithm to find the longest palindrome that is a suffix of a string T of length n. Recall that apalindrome is a string that is equal to its reversal. What is the running time of your method?