Do in C++ please. Thank you.

You are going to write a class to implement a Trie data structure and a program to test it The trie efficiently stores words, as in a spell-checker. To simplify matters, words will be restricted to strings of no more than 20 lower-case characters, excluding spaces or punctuation marks The member functions of the Trie class will be: boolean insert (String s); boolean isPresent(String s); // returns true if s is present, false otherwise boolean delete(String s); int membership(); void listAll) // returns false if s is already present, true otherwise // returns false if s is not present, true otherwise // returns the number of words in the data structure // list all members of the Trie in alphabetical order A Trie is a tree containing nodes of degree 26. The following Trie contains the words: the, thin, tin, tint, sin, sing, so, son, song 9 The black Nodes have a boolean variable set to indicate the end of a word You are going to write a class to implement a Trie data structure and a program to test it The trie efficiently stores words, as in a spell-checker. To simplify matters, words will be restricted to strings of no more than 20 lower-case characters, excluding spaces or punctuation marks The member functions of the Trie class will be: boolean insert (String s); boolean isPresent(String s); // returns true if s is present, false otherwise boolean delete(String s); int membership(); void listAll) // returns false if s is already present, true otherwise // returns false if s is not present, true otherwise // returns the number of words in the data structure // list all members of the Trie in alphabetical order A Trie is a tree containing nodes of degree 26. The following Trie contains the words: the, thin, tin, tint, sin, sing, so, son, song 9 The black Nodes have a boolean variable set to indicate the end of a word