Java programming without package

You are going to write a class to implement a Tire data structure and a program to test it the tire 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 Tire class will be: Boolean insert(String s);//returns false if s is already present, true otherwise Boolean is Present(String s);//returns true if s is present, false otherwise Boolean delete(String s);//returns false if s is not present, true otherwise membership();//returns the number of words in the data structure void list All ();//list all members of the Tire in alphabetical order A Tire is a tree containing nodes of degree 26. The following Tire contains the words: the. thin. tin. tint, sin. sing, so. son, song. The black Nodes have a Boolean variable set to indicate the end of a word. Here are the class variables for the class Node: class Mode {Boolean terminal; out Degree; children Node[]; >