Suppose you are given a string s of length n. Describe an O(n)-time algorithm to find the longest string t that occurs both forwards and backwards in s. Your algorithm must use suffix trees or generalized suffix trees. For example: If s = yabcxqcbaz, your algorithm should return t = abc or t = cba because both abc and its reverse cba occur in s and no longer such string exists.