Tries and Suffix

1. How many children would the root (^) have in the suffix tree of the word 'SHESELLSSEASHELLS'?
2. In the suffix tree of 'SHESELLSSEASHELLS', S is a child of the root. How many direct children does this node containing S have?
3. If you have a text file of n characters containing words all of which are under k characters in length, and you want to search for a word of length less than m in it, what can be the estimated complexity of this search? (Answers are in the form ) Note: We are only trying to search for complete words, not patterns.
4. Which of the following tasks can a Trie or a Suffix Tree be used for? (Select ALL that apply)