QUESTION 4 Consider the trie below, constructed from the patterns TREE, THERE, HERE, HE, where the nodes have been numbered for identification. Determine whether the following are true: when we construct the suffix links in the Aho-Corasick algorithm, 1) The suffix link from node 8 will go to node 3. 2) The suffix link from node 10 will go to node 9. Both are true 1) is true, 2) is false 1) is false, 2) is true Both are false. QUESTION 5 Assume we are keeping track of a disjoint set data structure, depicted below: Which of the following are true: 1) When we merge the two trees by height, 1's parent will be 5. 2) If we find 6 and do path compression, 6's parent will be 4. Both are true. Both are false. 1) is true, 2) is false. 1) is false, 2) is true 0