PLEASE HELP ME WRITE THIS JAVA CODE. THIS IS THE 4TH TIME I AM POSTING THIS. THIS SHOULD BE A EASY CODING PROBLEM. NO ONE HAS GIVEN AN ANSWER TO ANY OF MY QUESTIONS THAT I HAVE POSTED. PLEASE HELP.

-------------------------------------------------------------------------------------------------

Please help me write this Java 8 code. The question shows sample code in C++, but the final code should be written in Java 8. Please include screenshots of your input and output, which should match the ones in the question. Thank You!

For this assignment, you will implement a trie (prefix tree) and use it to solve a couple of problems. In C++, the trie node and class definitions might look like: struct TrieNode [ bool leaf; vector alpha; 0; class Trie TrieNode root; You will need to implement the three class methods we did in class (feel free to use that code if you wish): lookup, which returns a boolean indicating whether the target was found; insert, which adds a string to the AVL tree; and remove, which removes a string from the trie (really removes it, instead of just changing the flag). You will also need to implement additional functions: alphabetical, which prints the contents of the trie in alphabetical order; autocomplete, which prints alphabetically all possible words that can be formed by a prefix and k additional characters; and count, which prints the number of words in the trie. For example, in C++, the function headers would be the following: For this assignment, you will implement a trie (prefix tree) and use it to solve a couple of problems. In C++, the trie node and class definitions might look like: struct TrieNode [ bool leaf; vector alpha; 0; class Trie TrieNode root; You will need to implement the three class methods we did in class (feel free to use that code if you wish): lookup, which returns a boolean indicating whether the target was found; insert, which adds a string to the AVL tree; and remove, which removes a string from the trie (really removes it, instead of just changing the flag). You will also need to implement additional functions: alphabetical, which prints the contents of the trie in alphabetical order; autocomplete, which prints alphabetically all possible words that can be formed by a prefix and k additional characters; and count, which prints the number of words in the trie. For example, in C++, the function headers would be the following