Two exercises: 2.1 and 2.2 22-2.1 - LAB EXERCISE - MERGE Assignment: 1. Use your Sorting Template Program, L.A.20.1, as a starting point and keep the following routines: fillArray screenOutput swap selectionSort a. Remove the main menu, the other sorting algorithms, the global steps counter and save as a new file. b. Resize the integer constant SIZE to 200. 2. Modify the screenOutput function to print 20 numbers across each line. 3. As explained in the student outline, write a function to merge two sorted lists into one sorted list. 4. Fill two lists, A and B, with the suggested amounts of data given below. Simply call fillArray twice in your program. 5. Now send the two lists, A and B, to the merge function and have it return list C with the merged results. 6. Print out all three lists using three calls to function screenOutput. Instructions: 1. The merge algorithm is prone to logic errors. The most common error is dealing with cases when you have reached the end of one list or the other. You are to test these 6 different input scenarios: List A List B Quantity Largest Quantity Largest Value Value Trial 1 20 100 40 100 Trial 2 40 100 20 100 Trial 3 20 100 40 50 Trial 4 20 50 40 100 Trial 5 40 50 20 100 Trial 6 40 100 20 50 LAB EXERCISE 22-2.2 MERGESORT (RECURSIVE) Assignment: 1. Using the merge program in lab exercise L.A.22.1, Merge, as a starting point, write a recursive mergeSort function as described in the student outline. 2. You will have to modify the merge function to fit the necessary calls of the mergeSort function. Instructions: 1. After confirming that your mergesort works, paste the necessary routines into your sorting template program and count the number of steps for a recursive mergesort. Record the number of steps on the worksheet from Lesson 20, Worksheet W.A.20.1, Comparison of Sorting Algorithms. 2. Turn in your source code and a printed run output of 100 numbers, sized from 1-200. If possible, print only functions merge and mergeSort.