Question 1 20 points (a) [5 points] List the suffixes of the string T = ATATAAT$. (b) [5 points] Draw the suffix trie for T. Include edge labels. Enumerate your nodes 1, 2, ... |VI, where |V) is the total number of nodes in the trie. (c) [5 points] Repeated sequences in T are shared prefixes of any suffix of T. Using the trie, list the repeated substrings of T. (d) [5 points) The depth of a node in a tree is the number of edges traversed on the path from the root to the node. A branching node is a parent node with more than one child. Can the branching node with the maximum depth among all branching nodes in a trie have a depth different from the longest repeat in T? Explain your answer. Question 1 20 points (a) [5 points] List the suffixes of the string T = ATATAAT$. (b) [5 points] Draw the suffix trie for T. Include edge labels. Enumerate your nodes 1, 2, ... |VI, where |V) is the total number of nodes in the trie. (c) [5 points] Repeated sequences in T are shared prefixes of any suffix of T. Using the trie, list the repeated substrings of T. (d) [5 points) The depth of a node in a tree is the number of edges traversed on the path from the root to the node. A branching node is a parent node with more than one child. Can the branching node with the maximum depth among all branching nodes in a trie have a depth different from the longest repeat in T? Explain your