Extend the class linkedList Type by adding the following operations: Find and delete the node with the smallest info in the list. (Delete only the first occurrence and traverse the list only once.) a. Find and delete all occurrences of a given info from the list. (Traverse the list only once.) b. Add these as abstract functions in the class linkedList Type and provide the definitions of these functions in the class unorderedLinkedList. Also, write a program to test these functions. nodeType (const nodeType &otherNode); //Copy constructor ~nodeType (); //Destructor private: Type info; nodeType *link; }; Write the definitions of the member functions of the class nodeType. Also, write a program to test your class.