c++

Exercise Summary: Implement following classes and functions (Either C or C++ style is fine). Please note, it is better to practice on your own first. Do not refer to any material until getting stuck. 1. Node class that can store integer data and the address of next Node. 2. SLL class that has front and back as reference points. a. InsertFront function: inseya new node as the st node of the list. b. DeleteFront function: delcto the very first node of the list. c. DeleteLast function: delete the very last node from the list. d. InsertInOrder function: insert a new node so the list reads in ascending order from the beginning to the end. e. removeOneTargetNode(int target) //remove the first target node found in the list f. removeAllTargetNodes(int target)//remove all target node(s) found in the list g. isDuplicate //return true if there is any node that are duplicate in the list. For example, 1->2->3->4 is a unique SLL. However, 1->2-3->25l is duplicate since I repeats two times and 2 repeats two times