10 Properties of sorting algorithms. Suppose that you are sorting an array of n distinct items using the versions of insertion sort and mergesort from this course. For each statement on the left, determine whether it is a property of insertion sort, mergesort, neither, or both, by choosing the best-matching letter on the right. The number of compares is linearithmic in the worst case. A. insertion sort only B. mergesort only If the input array is in ascending order, then the total number of compares is linear C. both It uses only a constant amount of extra memory D. neither (besides the input array). Any pair of items is compared at most once. The number of compares depends only on the number of items in the array (and not on their values)