_{(Longest forward-backward contiguous substring) Describe and analyze an efficient algorithm to find the length of the longest contiguous substring that appears both forward and backward in an input string T[1, . . . , n]. The forward and backward substrings must NOT overlap. Here are several examples. Given the input string ALGORITHM, your algorithm should return 0. Given the input string RECURSION, your algorithm should return 1, for the substring R.}

_{Given the input string REDIVIDE, your algorithm should return 3, for the sub- string EDI. (The forward and backward substrings must not overlap!)}

_{Given the input string DYNAMICPROGRAMMINGMANYTIMES, your algorithm should return 4, for the substring YNAM. (It should not return 6, for the subsequence YNAMIR, because its not contiguous.).}