Please use c++

8. Suppose we are using the usual node definition (with member functions called data and link). Your program is using a node variable called head ptr to point to the first node of a linked list (or head ptrNULL for the empty list). Suppose that p is a pointer to node in a linked list, and p is not the tail node. Write a few lines of C++ code that will remove the node after p. (5 points) 9. Implement the following function as a new function for the linked list toolkit. Do not call any of the other toolkit functions from within your implementation. (Use the usual node definition with member variables called data and link.) void list insert_zero (node previous ptr)i / Precondition: previous ptr is a pointer to a node on a linked list Postcondition: A new node has been added to the list after l the node that previous ptr points to. The new node contains 0.(5 points