For these problems, assume that you are using Insertion Sort with a sentinel (as done in class). Assume that the first and second smallest elements are next to each other (somewhere in the input), the third and fourth smallest elements are next to each other, the fifth and sixth smallest elements are next to each other, etc. Here is a GENERAL EXAMPLE: 50, 60, 40, 30, 90, 100, 10, 20, 80, 70 (The algorithm does not know this, and executes without the extra information. Assume that the problem size n is even.) For each problem show your work. Problem 3. Assume that each pair is in a random order, and that the pairs are in random order. The GENERAL EXAMPLE is a possible order. What is the exact number of comparisons in the average case as a function of n