Implement the following classes and functions: 1 /* SLL = Singly Linked List */ 2 template 3 class SLList { private: /* Class exercise to fill in. */ public: /* Empty constructor shall create an empty Linked List! */ SLList(); 4 5 6 7 8 9 10 /* Do a deep copy of sll into the this. * Note: This one uses a reference to a Singly Linked List! 11 12 13 SLList(const SLList &sll); 14 15 /* Deconstructor shall free up memory */ SLList(); 16 17 18 /* Return the current length of the Singly Linked List */ int getLength() const; 19 20 21 /* Insert at the end of the list.*/ bool append(const T &val); 22 23 24 /* Insert val at position pos. 25 26 * Return true if successful (it can be placed.) * Otherwise return false. */ bool insert(const int pos, const T &val); 27 28 29 30 /* Print out the Singly Linked List */ void print() const; 31 32 33 34 35 /* Remove the first instance of val * Return true if found and removed. * Otherwise return false. */ bool remove(const T &val); 36 37 38 39 /* Retrieves the element at position pos */ T& operator [] (const int pos); 40 41 42 43 /* Returns if the two lists contain the same elements in the * same order. */ bool operator==(const SLList &list) const; 44 45 46 }; 47 Implement the following classes and functions: 1 /* SLL = Singly Linked List */ 2 template 3 class SLList { private: /* Class exercise to fill in. */ public: /* Empty constructor shall create an empty Linked List! */ SLList(); 4 5 6 7 8 9 10 /* Do a deep copy of sll into the this. * Note: This one uses a reference to a Singly Linked List! 11 12 13 SLList(const SLList &sll); 14 15 /* Deconstructor shall free up memory */ SLList(); 16 17 18 /* Return the current length of the Singly Linked List */ int getLength() const; 19 20 21 /* Insert at the end of the list.*/ bool append(const T &val); 22 23 24 /* Insert val at position pos. 25 26 * Return true if successful (it can be placed.) * Otherwise return false. */ bool insert(const int pos, const T &val); 27 28 29 30 /* Print out the Singly Linked List */ void print() const; 31 32 33 34 35 /* Remove the first instance of val * Return true if found and removed. * Otherwise return false. */ bool remove(const T &val); 36 37 38 39 /* Retrieves the element at position pos */ T& operator [] (const int pos); 40 41 42 43 /* Returns if the two lists contain the same elements in the * same order. */ bool operator==(const SLList &list) const; 44 45 46 }; 47