Exercise 4: The suffix tree in some sense organizes all the substrings of Text in a way that substring occurrences can be quickly identified and processed. This is a cryptic statement, so an example can be helpful. In the text, we mentioned the Longest Repeat Problem, stated as follows. Longest Repeat Problem: Find the longest repeat in a string. Input: A string Text. Output: A longest substring of Text that appears in Text more than once. Where can repeated substrings of Text be found in the suffix tree of Text? Where is the longest repeat of Text hiding? Exercise 4: The suffix tree in some sense organizes all the substrings of Text in a way that substring occurrences can be quickly identified and processed. This is a cryptic statement, so an example can be helpful. In the text, we mentioned the Longest Repeat Problem, stated as follows. Longest Repeat Problem: Find the longest repeat in a string. Input: A string Text. Output: A longest substring of Text that appears in Text more than once. Where can repeated substrings of Text be found in the suffix tree of Text? Where is the longest repeat of Text hiding