The next question uses the following class, which implements a linked list:$2.(2$ pts$)$ Define the public member function removeLast$()$ that removes the last$$element from the linked list. If the list is empty, the function should do nothing$($it should not cause an error, it should not output an error message$).//$ C$++$class List $\{$private:$$struct Node $\{$string value;$$Node $*$next;$\}$;$//$points to the first node$$Node $*$head;$$public:$$List$()\{$head$=$NULL;$\}$void removeLast$()$;$\}$;