4. (5 points- Correctness) Ternary Trie Insert : Refer to the ternary trie shown below to answer both items. RN (a) (3 points - Correctness) List all the words stored in this ternary trie, arranged in lexicographical (alphabetically sorted) order in their corresponding box below. We may have included more boxes than there are words in the trie. If you think that's the case, leave the unneeded boxes completely blank. (Example: If the words were A, B and C, the right answer would have A in square #1, B n square #2 and C in square #3, and boxes #4-12 completely blank.) 10. 12. (b) (2 points Correctness) Insert the words BRIM and DRUM into the trie shown above. Draw the resulting RN 5. (4 points - Completeness) Implementing Multiway Trie: Below is C++ node class defined as: class Node public: class MultiwayTrie public: bool word false; Node* children [26]; Node ) Node root- new Node ); bool find (string word); void insert (string word); void remove (string word); Node: :Node (void) for (int i 0; i