Write a program to reverse words contained in a given a diverse input file using doubly linked lists. Phase 1 (Part 1 of Homework): The input is one text file, with strings, where a string is a sequence of letters (simple words) or a sequence of digits (i.e. simple integers). Strings are separated by spaces, commas (repeated spaces should be considered as one space). Each line has a line feed (\n) in Unix format (be careful if you develop your program in Windows and you port it later to Unix). You can assume each string will be at most 30 characters long and it is acceptable to use any data type or class for such string (i.e. char[] array, string class, char *, etc). Notice that words can be followed by punctuation signs and that some of them can be capitalized (upper case). This should not interfere with your results: a capitalized word is the same as a non-capitalized word for the purposes of this homework. Uppercase letters can be anywhere in the word, for ex.: ”Hungry”, ”hungry” and ”hUngry” should be counted as the same word. Punctuation and separators should be ignored. REQUIREMENTS: Each line of input file has to be stored as doubly linked list. Functions: insertion, traversal, print. It is acceptable to have an array of linked lists, assuming the file has up to 1000 lines, but keep in mind Phase 2 where the input file may be much larger. Your program must display on the screen the number of lines in the file and the number of bytes used by the program (it is expected each student will have slight differences). It is expected different files will use different memory size. The input file may have up to 1000 lines. It is important NOT to include any messages or in the output file. Your README file must explain in which file and class you programmed the doubly linked lists (preferably one file). The TAs will specificaly review your source code to make sure you do not use arrays to store each line. You are not allowed to use the linked list template in the STL Library. Any program using arrays or the STL list classes to store each line will receive a 20/100 as maximum grade. Example of input file (t.txt): xyz abc fun sad book 123,678+1000 a AA aaa123, $% [X] Expected result for output.txt x 123 aaa aa a 1000 678 123 book sad fun abc xyz