i want the code please

#ifndef H_LinkedListType #define H_LinkedListType #include  #include  #include  using namespace std; template  struct nodeType { Type info; nodeType *link; }; template class linkedListType { template friend ostream& operator&); template friend ofstream& operator&); public: const linkedListType& operator= (const linkedListType&); //Overload the assignment operator. void initializeList(); //Initializes the list to an empty state. //Postcondition: first = NULL, last = NULL, // count = 0 bool isEmptyList(); //Function to determine whether the list is empty. //Postcondition: Returns true if the list is empty; // otherwise, returns false. int length(); //Function to return the number of nodes in the //list. //Postcondition: The value of count is returned. void destroyList(); //Function to delete all the nodes from the list. //Postcondition: first = NULL, last = NULL, // count = 0 Type front(); //Function to return the first element of the list. //Precondition: The list must exist and must not be //empty. //Postcondition: If the list is empty, then the // program terminates; otherwise, // the first element of the list is // returned. Type back(); //Function to return the last element of the //list. //Precondition: The list must exist and must not //be empty. //Postcondition: If the list is empty, then the // program terminates; otherwise, // the last element of the list is // returned. bool isItemAtEqual(int location, Type item); bool search(const Type& searchItem); //Function to determine whether searchItem is in //the list. //Postcondition: Returns true if searchItem is found // in the list; otherwise, it returns // false. void insertFirst(const Type& newItem); //Function to insert newItem in the list. //Postcondition: first points to the new list // and newItem is inserted at the // beginning of the list. void insertLast(const Type& newItem); //Function to insert newItem at the end of the //list. //Postcondition: first points to the new list, // newItem is inserted at the end // of the list, and last points to // the last node in the list. void insertAt(int location, const Type& newItem); //Function to insert newItem at given location in the //list. void removeAt(int location); //Function to remove item at location in the //list. void retrieveAt(int location, Type& retItem); //Function to get the item at given location in the //list. void replaceAt(int location, const Type& repItem); //Function to replace the item at given location by repItem bool deleteNode(const Type& deleteItem); //Function to delete deleteItem from the list. //Postcondition: If found, the node containing // deleteItem is deleted from the // list, first points to the first // node, and last points to the last // node of the updated list. linkedListType(); //default constructor //Initializes the list to an empty state. //Postcondition: first = NULL, last = NULL, // count = 0 linkedListType(const linkedListType& otherList); //copy constructor ~linkedListType(); //destructor //Deletes all the nodes from the list. //Postcondition: The list object is destroyed. protected: int count; //variable to store the number of //elements in the list nodeType *first; //pointer to the first node of //the list nodeType *last; //pointer to the last node of //the list private: void copyList(const linkedListType& otherList); //Function to make a copy of otherList. //Postcondition: A copy of otherList is created // and assigned to this list. }; template bool linkedListType::isEmptyList() { return(first == NULL); } template linkedListType::linkedListType() // default constructor { first = NULL; last = NULL; count = 0; } template void linkedListType::destroyList() { nodeType *temp; //pointer to deallocate the memory //occupied by the node while(first != NULL) //while there are nodes in the list { temp = first; //set temp to the current node first = first->link; //advance first to the next node delete temp; //deallocate memory occupied by temp } last = NULL; //initialize last to NULL; first has already //been set to NULL by the while loop count = 0; } template void linkedListType::initializeList() { destroyList(); //if the list has any nodes, delete them } template int linkedListType::length() { return count; } // end length template Type linkedListType::front() { assert(first != NULL); return first->info; //return the info of the first node }//end front template Type linkedListType::back() { assert(last != NULL); return last->info; //return the info of the first node }//end back template bool linkedListType::search(const Type& searchItem) { nodeType *current; //pointer to traverse the list bool found; current = first; //set current to point to the //first node in the list found = false; //set found to false while(current != NULL && !found) //search the list if(current->info == searchItem) //the item is found found = true; else current = current->link; //make current point //to the next node return found; }//end search template bool linkedListType::isItemAtEqual(int location, Type item) { nodeType *temp; int counter; if ( count != 0 ) { counter = 0; temp = first; while ( temp != NULL && counter link; counter++; } if ( temp != NULL && temp->info == item ) return true; } return false; } template void linkedListType::insertFirst(const Type& newItem) { nodeType *newNode; //pointer to create the new node newNode = new nodeType; //create the new node assert(newNode != NULL); //If unable to allocate memory, //terminate the program newNode->info = newItem; //store the new item in the node newNode->link = first; //insert newNode before first first = newNode; //make first point to the //actual first node count++; //increment count if(last == NULL) //if the list was empty, newNode is also //the last node in the list last = newNode; } template void linkedListType::insertLast(const Type& newItem) { nodeType *newNode; //pointer to create the new node newNode = new nodeType; //create the new node assert(newNode != NULL); //If unable to allocate memory, //terminate the program newNode->info = newItem; //store the new item in the node newNode->link = NULL; //set the link field of newNode //to NULL if(first == NULL) //if the list is empty, newNode is //both the first and last node { first = newNode; last = newNode; count++; //increment count } else //the list is not empty, insert newNode after last { last->link = newNode; //insert newNode after last last = newNode; //make last point to the actual last node count++; //increment count } }//end insertLast template void linkedListType::insertAt(int location, const Type& newItem) { //INCLUDE YOUR DEFINITION HERE } template void linkedListType::removeAt(int location) { //INCLUDE YOUR DEFINITION HERE } template void linkedListType::retrieveAt(int location, Type& retItem) { //INCLUDE YOUR DEFINITION HERE } template void linkedListType::replaceAt(int location, const Type& repItem) { //INCLUDE YOUR DEFINITION HERE } template bool linkedListType::deleteNode(const Type& deleteItem) { nodeType *current; //pointer to traverse the list nodeType *trailCurrent; //pointer just before current bool found; if(first == NULL) //Case 1; list is empty. { cerrinfo == deleteItem) //Case 2 { current = first; first = first->link; count--; if(first == NULL) //list has only one node last = NULL; delete current; return true; } else //search the list for the node with the given info { found = false; trailCurrent = first; //set trailCurrent to point to //the first node current = first->link; //set current to point to the //second node while(current != NULL && !found) { if(current->info != deleteItem) { trailCurrent = current; current = current->link; } else found = true; } // end while if(found) //Case 3; if found, delete the node { trailCurrent->link = current->link; count--; if(last == current) /ode to be deleted was //the last node last = trailCurrent; //update the value of last delete current; //delete the node from the list return true; } else { cout ostream& operator& list) { nodeType *current; //pointer to traverse the list current = list.first; //set current so that it points to //the first node while(current != NULL) //while more data to print { osObjectinfolink; } return osObject; } //Overloading the stream insertion operator to output files template ofstream& operator& list) { nodeType *current; //pointer to traverse the list current = list.first; //set current so that it points to //the first node while(current != NULL) //while more data to print { osObjectinfolink; } return osObject; } template linkedListType::~linkedListType() // destructor { destroyList(); }//end destructor template void linkedListType::copyList (const linkedListType& otherList) { nodeType *newNode; //pointer to create a node nodeType *current; //pointer to traverse the list if(first != NULL) //if the list is nonempty, make it empty destroyList(); if(otherList.first == NULL) //otherList is empty { first = NULL; last = NULL; count = 0; } else { current = otherList.first; //current points to the //list to be copied count = otherList.count; //copy the first node first = new nodeType; //create the node assert(first != NULL); first->info = current->info; //copy the info first->link = NULL; //set the link field of //the node to NULL last = first; //make last point to the //first node current = current->link; //make current point to //the next node //copy the remaining list while(current != NULL) { newNode = new nodeType; //create a node assert(newNode!= NULL); newNode->info = current->info; //copy the info newNode->link = NULL; //set the link of /ewNode to NULL last->link = newNode; //attach newNode after last last = newNode; //make last point to //the actual last node current = current->link; //make current point to //the next node }//end while }//end else }//end copyList //copy constructor template linkedListType::linkedListType (const linkedListType& otherList) { first = NULL; copyList(otherList); }//end copy constructor //overload the assignment operator template const linkedListType& linkedListType::operator= (const linkedListType& otherList) { if(this != &otherList) //avoid self-copy copyList(otherList); return *this; } #endif

Project 1: Linked List Due date: Sunday, 2/22/23@11:59pm Problem Description For this assignment you must implement four functions to the class linkedListType. 1. void insertAt (int location, const Types insertitem). Function to insert an item in the list at the position specified by location. The item to be inserted is passed as a parameter to the function. If location is out of range, the item will be inserted at the end of the list. 2. void removeAt (int location). Function to remove the item from the list at the position specified by location. If location is out of range, an appropriate message is displayed. 3. void retrieveAt (int location, Type \& retitem). Function to retrieve the element from the list at the position specified by location. The item retrieved is copied in the parameter retItem. If location is out of range, an appropriate message is displayed. 4. void replaceAt(int location, const Type\& repitem). Function to replace the element in the list at the position specified by location. The item to be replaced is specified by the parameter repItem. If location is out of range, an appropriate message is displayed. Assume that if there are n elements in the list, then the first element is at position 0 and the last element is at position n1