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. Introduce a SLL class with the following functions. Please call each of them at least one time in main function: 2. a Intreduee-insert te frent funetion b. Introduce insert to_back function. c. Introduce delete_from front function. d. Introduce delete from back function. e. Introduce print funetion that traverses SLL nede by nede-and print each Nede's value f. Traverse to the middle of SLL and delete the middle node. (If there are even number of nodes, for convenience, the left of the two nodes in the middle of SLL is your middle node) g. Traverse to the middle ef SLL and insert a nede in the middle ef SLL h-_-Returnthe-mini mtvalue ofSLL. i. [Challenging question] Delete all nodes of SLL in an ascending order. 3. Introduce a SLL2 class that has both front and back variables. Please introduce the following functions. Please call each of them at least one time in main function a. Introduce insert to front function. b. Introduce insert to back function. c. Introduce delete from front function. d. Introduce delete from_back function. e. Traverse to the middle of SLL2 and delete the middle node. (If there are even number of nodes, for convenience, the left of the two nodes in the middle of SLL2 is your middle node)