C++, can you please do the whole problem and explain each step too. Thank you for your help and have a great day

(include whole code too)

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: insert a new node as the first node of the list.

b. DeleteFront function: delete 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->2->1 is duplicate since 1 repeats two times and 2 repeats two times.