Question 2 Consider the following declarations when answering this question: class node [ public: int data: node "next, prev: }; class LIST [ public: void remove_front ); private: node "front, "back; //pointer to the front and back of the doubly linked //list, respectively. The list is not circular. 3: Implement the function "remove_front" to remove a node to the front of the list