The quadratic selection sort is described as follows: Divide the n input elements into k groups of k elements each, where k = n. Find the largest element of each group and insert it into an auxiliary array a. Find the largest of the elements in a. This is the largest element of the file. Then replace this largest element in a by the next largest element of the group from which it came. Again, find the largest element in a. This is the second largest element of the file. Repeat the process until the file has been sorted. Use the following 16 elements to explain how this algorithm works: 14, 5, 3, 8, 13, 15, 2, 9, 10, 4, 1, 6, 16, 7, 11, 12.