Solve in c++

Deleting a Node from the Middle of a Linked List The deletion of a node from a linked list must be done in several steps. Here is the process (Suppose the target is located between two nodes before and after) 1) Search for the node that is to be removed, target, and store the pointer to it in target ptr 2) Create a before pointer and advance it to the node that comes before target ptr. To do this, you can use a while loop that advances before pointer while before_pointer-link!-target ptr 3) Connect the link from the node before pointer to the node after target ptr 3) Discard the node referred to by target ptr Exercise 15.3 Open file ex15 3 and add code to input a target to delete from the list. Have it delete the node containing the requested target item from the middle of the linked list