Recursive Linked List

Goals: To learn how to traverse a linked list recursively Overview: You will write a program (not a class) that will do several functions on a linked list recursively. You will also include the code you wrote first quarter so that you can see things side by side. What to do: Find your linked list code from first quarter and modify to implement the following functions: PrintListIterative PrintListRecursive InsertListIterative (make sure the list is ordered) InsertListRecursive (make sure the list is ordered) PrintListBackwardIterative PrintListBackwardRecursive You can use a simple struct with a single item of type int and a pointer to next. Use the following main function to demonstrate that all of the functions work. Make sure you test the insert function fully by inserting items at the front and back of the list. int main() { ptrType theList1; ptrType theList2; ReadItems(theList1); ReadItems(theList2); char ans = 'y'; int num = 0; while (num != -999) { PrintListIterative(theList1); cout << endl << endl; PrintListRecursive(theList2); cout << endl << endl; PrintListBackwardIterative(theList1); cout << endl << endl; PrintListBackwardRecursive(theList2); cout << endl << endl; cout << "enter num to insert (or -999 to end) "; cin >> num; InsertListRecursive(theList2,num); InsertListIterative(theList1,num); } } Do not use any global variables. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Coder retains all rights except for my personal use ## Platform C++ Windows XP