Unfortunately, C++ does not natively have a Multiway Trie implementation for us to use in our Lexicon class implementation. Fortunately for you, we have defined the following MultiwayTrie class for you to use (the same class you implemented on the previous step):

Unfortunately, C++ does not natively have a Multiway Trie implementation for us to use in our Lexicon class implementation. Fortunately for you, we have defined the following Multiway Trie class for you to use (the same class you implemented on the previous step) class MultiwayTrie { public: bool find(string word) I1 "find" function of MultiwayTrie class void insert (string word); // "insert" function of MultiwayTrie class void remove(string word); "remove" function of MultiwayTrie class 3i In this challenge, you will use the MultiwayTrie class we defined for you to implement the Lexicon class. Below is the C+Lexicon class we have declared for you: class Lexicon [ public: MultiwayTrie mwt; bool find (string word); II"find" function of Lexicon class void insert (string word); // "insert" function of Lexicon class void remove(string word); Il "remove" function of Lexicon class // instance variable MultiwayTrie object Sample Input: N/ A Sample Output: N/A Code Challenge-Write a program, test using stdin stdout Time Limit: 5 seconds Memory Limit: 256 MB 1Return trus if Lexicon contains vord otherwise return false 2 bool Lexicon::findstring vord) I YCUR OODE HERE 6 Insert vord into Lexi con (retur nothing/ 7 void Lexicn::insert (string vord) YOUR CODE HERE 10 11 Renove vord fron Laxicon (return nothing 12 void Lexicon: :renove (string vor 13 YCUR OODE HERE