C++ For the following declaration, write the code as asked. The pointer variable first points to the first node of the linked list. Each node has data member that stores the data and the next member that stores the address of the next node.

Given the declaration:

Write C++ code that deletes all the nodes between and inclusive the nodes pointed to by ptr1 and ptr2 in the displayed linked list. (This link Shows that there may be as any number of nodes in between the connected nodes. This link shows the link to the next node) 1 Linked list after: (Just give the code that does this task. DO NOT write the whole function)