Program for COSC 503 May 1, 2018 Note: All C++ programs must be fully documented. Write a program that uses the operations described below on a singly linked list. Input and output file usage is required. The data is composed of variable length strings. Each node contains a string and the length of the string. Part I Fill the linked list with at least 15 nodes using an input file. Remove the first node from the linked list and print the contents. The node should then become the first node in a new linked list. The linked original linked list is otherwise left unchanged. Implement the recursive reverse print function for a linked list. Implement the standard print function for a linked list that will leave the linked list unchanged. Write a function that will find the length of a linked list. Write a function that will destroy a linked list. Write a function that will insert an element at the head of a linked list. Write a function that will insert an element at the tail of a linked list. Write a function that will form the union of two linked lists. You need two different linked lists to show that this function works Write a function that will take two lists and form the intersection of two lists Write a function that will find the maximum and the minimum last names in a linked list. The maximum value is returned. Write a function insert(Lentry, ename) such that a new node is inserted in the correct position. The new name is in the variable ename Write a function delete(Lentry2, ename2) such that the node following the node containing the name stored in the variable ename2 is deleted. Write a function that will delete from the head of a linked list. Write a function that will delete from the tail of a linked list. Write a function that will create a copy of a linked list. The original linked list remains unchanged. Write a function that will replace every occurrence of a given name (you may choose the name that you want to delete), deletename, in a linked list with a new value, newname. The linked list remains otherwise unchanged. Remember that order is important so choose your new name wisely Write a function that will reverse a linked list. - - - - - - Note: To prove that a function works, you must print the linked list prior to the actions of the function and after the actions of the function. New linked lists must also be printed to show that they have been created. Due date: May 17, 2018