Please answer the following question in C/C++.

Implement following classes and functions (Either Cor 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. DNode class that can store integer data and the address of next and prev DNode. 2. Introduce a DLL (Doubly Linked List) class a. Introduce a "front" private data member b. Introduce a DLL constructor and destructor c. Introduce insert To Front function d. Introduce deleteFromFront function c. Introduce printAll function Introduce delete Last function & Introduce insert To Middle function h. Introduce delete Middle function 1. Introduce delete LastNode function j InsertinOrder function: insert a new node so the list reads in ascending order from the beginning to the end. k removeOne TargetNode(int target) //remove the first target node found in the list I remove All TargetNodes[int targety/remove all target node(s) found in the m. 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> is duplicate since I repeats two times and 2 repeats two times. 3. Introduce a CLL (Doubly Linked List) class and all the above functions. (If there are even number of nodes, for convenience, the left of the two nodes in the middle of DLL CLL is your middle node) When the lab session is over, compress your cpp file(s) (and header file(8), if any) into a single zip file called Your Last Name-Labo.zip (eg, Liu-Lab6.zip) and upload it to Canvas. (DO NOT upload the entire project. Do not send me exe file.)