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. Introduce insert to front function. e--introduee delete-from-front-funettet Introduce print function that traverses SLL node by node and print each Node's value e. 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) Traverse to the middle of SLL and insert a node in the middle of SLL Return the minimum value of SLL. [Chatlenging question g. h. es-of SLL in an aseending order