The input file will be in the following format one word per


Create three classes for the words: An abstract class called Word, a class called Noun that inherits from Word, and a class called Verb that inherits from Word. The actual word is stored in class Word. The classes Noun and Verb should have different toString methods the return the word with either "(N)" or "(V)" appended.

Create three classes for the linked list: An abstract class called WordList which contains all the functionality of the linked list, and classes called UnsortedWordList and SortedWordList which inherit from WordList. Each of these two classes should have an insert method that adds a new word in the appropriate position in the list.

The GUI should now have two TextAreas: the one on left showing the contents of the unsorted list, and the one on the right showing the contents of the sorted list. The command window (ADD, DELETE, STOP) should function.

Create two menus for the GUI: One called File (with choices Open and Quit), and one called Display (with choices Nouns and Verbs).
File > Open: open the selected file, fill the linked lists and display them in the text areas.
File > Quit: exit the program.
Display > Nouns: clear the text areas and then display only the nouns on the lists.
Display > Verbs: clear the text areas and then display on the verbs on the list.

The input file will be in the following format: one word per line followed by either N or V in parenthesis: apple(N) peach(N) eat(V) .

Solution Preview :

Prepared by a verified Expert
Basic Computer Science: The input file will be in the following format one word per
Reference No:- TGS01401959

Now Priced at $30 (50% Discount)

Recommended (97%)

Rated (4.9/5)