Complete the functions for insert and operator ==

#include "SLL.hpp" #include SLLNode:: SLLNode() { x = 0; next = NULL; } SLLNode::SLLNode(int _X, SLLNode *_next) { X = _X; next = _next; } SLLNode* SLLNode::get_next() { return next; } int& SLLNode::get_value() { return x; } void SLLNode::set_next(SLLNode *_next) { next = _next; } SLL::SLL) { head NULL; tail NULL; } 28 29 /* Insert val at position pos. * Return true if successful (it can be placed.) * Otherwise return false. 30 31 32 bool insert(const int pos, T &val); 46 47 /* Returns if the two lists contain the same elements in the same order.*/ bool operator==(const SLList &list) const; 48 #include "SLL.hpp" #include SLLNode:: SLLNode() { x = 0; next = NULL; } SLLNode::SLLNode(int _X, SLLNode *_next) { X = _X; next = _next; } SLLNode* SLLNode::get_next() { return next; } int& SLLNode::get_value() { return x; } void SLLNode::set_next(SLLNode *_next) { next = _next; } SLL::SLL) { head NULL; tail NULL; } 28 29 /* Insert val at position pos. * Return true if successful (it can be placed.) * Otherwise return false. 30 31 32 bool insert(const int pos, T &val); 46 47 /* Returns if the two lists contain the same elements in the same order.*/ bool operator==(const SLList &list) const; 48