Your Tasks ●Read the description thoroughly and carefully to understand exactly what IsolateTargetSoloAsTail is meant to do and the IMPORTANT requirements you must meet when implementing the function. ●Fill in the prototype for IsolateTargetSoloAsTail in the supplied header file (llcpInt.h). ●Fill in the definition for IsolateTargetSoloAsTail in the supplied implementation file (llcpImp.cpp).●If node target cannot be found on the given list, a new node containing target is created and added to the end (made the new tail node) of the list.●If target appears only once on the given list, the target-matching node is moved to the end (made the new tail node) of the list.If target appears multiple times on the given list, the first target-matching node is moved to the end (made the new tail node) of the list, and all other target-matching nodes are to be deleted from the list.The order in which non-target-matching nodes originally appear in the given list must be preserved 7890103111214151617181926 21 22 23 24 25 25 27 28 29 30 1 2 3 34 35 3678 39 40202627313233// definition of Isolate TargetSoloAs Tail of Assignment 5 Part 141int FindList Length (Node* headPtr)int length = 0;{{while (headPtr != 0){36 {}}boolreturn length;++length;headPtr headPtr-link;}voidIs Sorted Up (Node* headptr)if (headptr == 0 ||headPtr-linkreturn true;while (headPtr-link != 0) // not at last node{}return true;==8) // empty or 1-nodeif (headPtr-link-data data)return false;headPtr headPtr-link;InsertAsHead (Node*& headPtr, int value)Node *newNodePtr = new Node;newNodePtr-data = value;newNodePtr-link = headPtr;headPtr = newNodePtr; #ifndef ASSIGN05P1_H#define ASSIGN05P1_H#include struct Node{};int data;Node *link;intFindList Length (Node* headptr);bool IsSortedUp (Node* headptr);voidvoidvoidboolInsertAsHead (Node*& headPtr, int value);InsertAsTail (Node*& headPtr, int value);InsertSortedUp (Node*& headPtr, int value);DelFirstTargetNode (Node*& headPtr, int target);DelNodeBefore1st Match (Node*& headPtr, int target);ShowAll (std::ostream& outs, Node* headptr);boolvoidvoid FindMinMax (Node* headPtr, int& minValue, int& maxValue);double FindAverage (Node* headptr);void ListClear (Node*& headPtr, int noMsg = 0);// prototype of Isolate TargetSoloAsTail of Assignment 5 Part 1#endif

Question

Your Tasks ●Read the description thoroughly and carefully to understand exactly what IsolateTargetSoloAsTail is meant to do and the IMPORTANT requirements you must meet when implementing the function. ●Fill in the prototype for IsolateTargetSoloAsTail in the supplied header file (llcpInt.h). ●Fill in the definition for IsolateTargetSoloAsTail in the supplied implementation file (llcpImp.cpp).●If node target cannot be found on the given list, a new node containing target is created and added to the end (made the new tail node) of the list.●If target appears only once on the given list, the target-matching node is moved to the end (made the new tail node) of the list.If target appears multiple times on the given list, the first target-matching node is moved to the end (made the new tail node) of the list, and all other target-matching nodes are to be deleted from the list.The order in which non-target-matching nodes originally appear in the given list must be preserved 7890103111214151617181926 21 22 23 24 25 25 27 28 29 30 1 2 3 34 35 3678 39 40202627313233// definition of Isolate TargetSoloAs Tail of Assignment 5 Part 141int FindList Length (Node* headPtr)int length = 0;{{while (headPtr != 0){36 {}}boolreturn length;++length;headPtr headPtr->link;}voidIs Sorted Up (Node* headptr)if (headptr == 0 ||headPtr->linkreturn true;while (headPtr->link != 0) // not at last node{}return true;==8) // empty or 1-nodeif (headPtr->link->data data)return false;headPtr headPtr->link;InsertAsHead (Node*& headPtr, int value)Node *newNodePtr = new Node;newNodePtr->data = value;newNodePtr->link = headPtr;headPtr = newNodePtr; #ifndef ASSIGN05P1_H#define ASSIGN05P1_H#include struct Node{};int data;Node *link;intFindList Length (Node* headptr);bool IsSortedUp (Node* headptr);voidvoidvoidboolInsertAsHead (Node*& headPtr, int value);InsertAsTail (Node*& headPtr, int value);InsertSortedUp (Node*& headPtr, int value);DelFirstTargetNode (Node*& headPtr, int target);DelNodeBefore1st Match (Node*& headPtr, int target);ShowAll (std::ostream& outs, Node* headptr);boolvoidvoid FindMinMax (Node* headPtr, int& minValue, int& maxValue);double FindAverage (Node* headptr);void ListClear (Node*& headPtr, int noMsg = 0);// prototype of Isolate TargetSoloAsTail of Assignment 5 Part 1#endif

Accepted Answer

Given description IsolateTargetSoloAsTail is meant to do and the important requirements you must…