1. (20 points) Write a C++ function which removes the last element from a linked list. Assume that you have only the first pointer (no last pointer) which points to the beginning of the list. Your code should work whether the linked list is empty, contains one or more nodes. The function prototype is given below, first points to the first element of the linked list. Also specify the time complexity of your function. void removeLast (NodeType < int>* &first)