when ucla opened its new campus in 1929 it had four buildings today the campus includes 163 buildings across 419 acres in the western part of los

In this assignment you will create a linked list. A linked list consists of a list of class objects which are connected via pointers. Your linked list in this assignment will be used to store word information read in from an input file. In particular, you will store each word encountered in the file along with the number of times that word was found.Linked List Creation 1) Create a class called “word” which stores a word as a string (name) along with an integre equal to the number of times it was found in the file (numTimes = 1). In addition, the class will contain two pointers, one which will point to the next word object in the list (next) and for extra credit one which will point to the previous word object in the list (previous). -----------Please note, using the previous pointer is more challenging and thus will be extra credit (+5 points) if properly used. 2.) Create an array of word objects. (suggested steps below)----(A) Create a function that creates a count of unique words in the list (no repeats). Use this count as the size of your word array. It might be helpful to have a string array of unique words uwords with initial length 1000, and compare each word to the array's values and add any new unique words to the next empty spot in the array (a string's default value is NULL). ----(B) Create a bool function called inList(string) which returns true if the string already appears as a name of a word object in the list, and false otherwise.----(C) Create a function called addWord(string) which will insert a new word object with name equal to the string parameter if it is not already contained in the list.----(D) Do not include repeated words. If a repeated word is found then increment the numTimes counter of the word object.3.) You will also want to create a pointer startOfList which will point to the first word object in the list (which originally will be set to null). 4.) Create a function called insert(word) which will insert a word object into the list, alphabetically according to the name of the word object. ----(A) For example, if your list currently contains the word objects with names “bubble”, “cat”, and “dog” and you call insert(newWord) with word object newWord whose name variable is “cobra”, the function will insert this word object between the two word objects “cat” and “dog”. This means the “next” pointer in the “cat” object will now point to the newWord object, the “previous” pointer in the newWord object will point to the “cat” object, the “next” pointer in the newWord object will now point to the “dog” object, and so on. To find the point of insertion, simply begin with the start of the list pointer and use the next (and previous) pointers to traverse the list and find the place for the word to be inserted.----(B) Sty setting the startOfList to the first word in your list.5.) Create a function display(string) which prints to the file with name equal to the string parameter, an alphabetical list of all words contained in the list along with the number of times they appeared in the input file.The input file you will use is called “LLwords.txt”. Note that for simplicity, all the words in this file are lower case. Your goal will be to read in all the words contained in that file, and output the alphabetical list of words along with the number of times they appear to an output file called “LLoutput.txt”.Suggestion... (only if tit helps...)1. Create a vector of word objects, vector<word> w(1); // a vector of word object of length one.2. Take in a the next string, fin>> TempName; // takes in the next string from the stream object fin.3. then each time you need to create a new word object use the push_back member function of the vector class w.push_back(word( "ANewTempName") ) ; //this would require a one parameter constructor word :: word(string n){name = n; numTimes = 1; } to add a new word. -------To set the name of new word at word[index] that you have not seen before, using a setName member function, word[index].setName(TempName);-------Then update the index++4. The vector of objects will grow as you need it, (adding a new words as they come) but the order should handled using only pointers.