. (4 points-Completeness) Implementing Multiway Trie Below is C++ node class defined as class MultiwayTrie f class Node public: 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 i0 i 26: ++i) children [1] NULL; = (a)(e points-Completeness) Write the implementation of the insert of the MultiwayTrie class method below /Insert word into MultiwayTrie (return nothing) / void MultiwayTrie::insert (string word) t (b) (2 points-Completeness)Write the implementation of the find method of the MultiwayTrie class method below. /* Return true if MultiwayTrie contains word, otherwise return false bool MultiwayTrie::find (string word) f