What is the average number of comparisons (give an exact number, not big O) required to sort an array of 10 elements using insertion sort? Assume that every element to be inserted in a partially sorted subarray has an equal likelihood of ending up in any of the possible locations.