C++ Linked Lists

Using the provided class definitions, extend and add the following 3 functions. 1. Write a function that returns the n-th element of the linked list. If no such element exists, terminate the program with an appropriate message. 2. Write a function that will locate and delete the node with the smallest info value in the list. Delete only the first occurrence and traverse the linked list only once. 3. Write a function called rotate(). This function will remove the first node of the linked list and add it to the end of the linked list. [login to view URL] a program to test out these new functions. Please place all source code in a single file, do not separate into separate header and implementation files.