Write the member function to search() the linked list for a particular piece of information. The search functiontakes a const T& as its parameter and it returns a boolean result. This member function should also be declaredas a const member function, as it does not change the list if it is called. An example implementaiton for this functionis actually given in our textbook, though you may need to change it slightly to work with our assignment code.2. Also add/write the deleteNode() member function, which is also given in our textbook implementation. Thisfunction takes a const T& as its parameter, which is the value of an item to search for and delete. Thus thefirst part of this function is similar to the search() function, in that you first have to perform a search to findthe item. But once found, the node containing the item should be removed from the list (and you should freethe memory of the node). This function is only guaranteed to find the first instance of the item and delete it, ifthe item appears multiple times in the list, the ones after the first one will still be there after the first itemis removed by this function. This function should return a LinkedListItemNotFoundException if the itemasked for is not found. The LinkedListItemNotFoundException class has already been defined for you in thestarting template header file.3. Write a member function named findItemAtIndex() for the LinkedList class. This function will be given asingle integer parameter called index. It will search through the linked list and return a reference to the info ofindex’th node in the list. It is important that you return a T& (a reference to a type T) from this function.This function works using 0 based indexing (like arrays), thus if we ask for index 0, the first or head node infoshould be returned. If we ask for index 1, the info in the node after the head node is returned. If the list onlyhas 5 nodes (indexes 0 to 4) and we ask for index 5 or greater, you should throw a LinkedListItemNotFoundexception. (This exception class has already been defined in the LinkedList header given to you, you simplyneed to throw it). For a little extra credit, you can add the overloaded operator[] to define indexing operationson your LinkedList which just uses your working findItemAtIndex() member function.4. Write a member function named deleteItemAtIndex(). This function will perform similar to the previous one,but instead of returning the info in the index’thed node, it will simply delete the node. Thus your logic will besimilar to task 3, you will need to search till you get to the index’thed node in the list. But at that point youshould remove the node (and don’t forget to delete it, to free up its memory). If the asked for index does notexist, as usual you should throw a LinkedListItemNotFound exception.5. Extra credit: you can write this recursive member function for a little bit of additional extra credit. Writea member function named toReverseString(). There is already a string function, that creates a stringrepresentation of the items in the list and returns the string. Your method will create a string of the items in2

Help me finish the last part of lab, not too much to do. Write a class ScoredQuiz which is a subclass of Quiz and adds code to keep a tally of the correct and incorrect answers. Reuse as much of the code in Quiz as you can. You may need to and are welcome to refactor Quiz to make it easier for your subclass to reuse code.