Create two programs in C++ to process sequences of values in two ways: 1) implementing it through a linked list, using dynamic data structures, 2) using STL::list. In both implementations, a specific function to process values should be created and presented in action (showing both initial and resulting values). In the case of linked-list, also auxiliary functions should be created, and allocated memory for the structure should be freed.

Create a function to delete element number n (parameter of function). Remember the value of deleted element v. Insert in place of a deleted element the element number v. In solution with linked list do not create a new element.