Assignment Description Through this assignment we want to implement a dictionary of words. We intend to help our user to find the meaning and synonyms of an entered word using the trie data structure, Data Items A trie node must consist of the following data items; 1. Meaning of the word 2. List of synonyms of the word. 3. Array of pointers of type tric node of length 26. 4. Flag that indicates the completion of the word. You can add other data items as per your logic Operations The "TRIE" class must have the following methods. 1. void CreateDictionary("./trie dictionary.txt") Requirements: None Result: A trie is created from dictionary.txt. The file is in the following format: -piper --someone who plays the bagpipe bagpiper musician player instrumentalist -pecked --(of a bird) strike or bite something with its beak. strike beak pick The line starting with single dash (-) consists of the word. The line starting with double dash (--) consists of the meaning of the word. Afterwards the lines without any dashes consist of the synonyms until the next word or end of file. 2. vector OutputAscending() Requirements: Trie is not empty Result: Output all the words in ascending order. 3. bool Find Word(key) Require Trie is not empty. Result: Search for the word with the given key 4. vector FindSynonyms(key) Requirements: Trie is not empty Result: Search for all the synonyms for a given key, 5. string Find Meaning(key) Requirements: Trie is not empty. Result: Search for the meaning of a given word. 6. vector OutputPrefix(prefix) Requirements: Trie is not empty Result: Search for all the words with the given prefix 7. vectors string> OutputSE(length) Requirements