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_ptr == NULL for the empty list). Suppose that p is a pointer to a 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.