Programming Assignment #1 Text Parser Overview You are to write a program that reads in a body of text and inserts the text into a Linked List class that you write from scratch. You should keep an instance count for each word in the text. Each time a duplicate word is added you should be able to update the instance count for that word inside the Node (this will require you to search the Linked List for each word entered). At the end of the text insertion you will show statistics for un. The purpose of this exercise is to give you familiarity with Text Parsing, and Linked Lists. You will read in a lengthy text file; Oscar Wilde's The Picture of Dorian Gray as text from guttenberg.org ttp://www.guten select the Plain Text UTF-8 link. As you read the text yo punctuation characters (Only numbers or letters should remain) removed characters should be eaten, NOT replaced with a space. Once the words are pre-processed you will insert them into a Linked List. If you have problems, search for 174 on Gutenberg.org, and u will map all words to lower case and remove all Do not modify the text file you download, although there are headers and footers from Gutenberg, please leave them intact. When the Linked List is loaded you will perform queries to demonstrate the following things (NOTE: these must be solved programmatically, no cheating, by just looking through the datafile to find the answer) 1 How many times do the following words appear in the text? a. portrait b. persian c. dorian d. experimental e. magnetic 2. How many entries are in the Linked List? 3. Which words occur more than 20 times, and how many times do they occur? 4. Which word occurs most frequently? 5. Which word is the longest in the book? 6. Which word occurs before the word irritating" (in the linked list)? No User Interface is required for this project. Suggestions (Use at vour discretion Download the text file to your local machine. Write a program to open the text file and display it verbatim before you start adding it to the Linked List Include a counter in each node to handle duplicate words