TLOAssume that the nodeType defined as the followingstruct nodeTypeint info;nodetype * link;node Type "List, "first, "current; *"last, "p, "temp;List1134000- 100→NULL47994.2.d.lastfirstcurrentWrite C++ code to delete the last node of the list and also deallocate the memory occupied by this node. After deleting the node make last point to thelast node of the list and the link of the last node must be nullptr. You can declare additional pointer variable if it is needed.Click Save and Submit to saue and submit. Click Save All Ansuers to save all answers.Save and SubmitEnglish (United States)Focus168%sp目tv15D0O000 F4F3F5F7F8F11%245.94.

1. If the first node is null or there is only one node, then they return null. if firstNode == null then return null if firstNode.nextNode == null then free head and return null 2. Create an extra space secondLast, and traverse the linked list till the second last node. while currrent.nextNode.nextNode != null current = current.nextNode 3. delete the last node, i.e. the next node of the second last node delete(current.nextNode), and set the value of the next current node to null. P.S. - I am using delete to free the allocated node, if malloc is used free to be used instead of deletestruct nodeType { // int info; // struct nodeType* link; // }; nodeType* removeLastNode(struct nodeType* first) { if (first == NULL) return NULL; if (first->link == NULL) { delete first; return NULL; } // Find the current node nodeType* current = first; while (current->link->link != NULL) current = current->link; // Delete last node delete (current->link); // Change next of current current->link = NULL; return first; }