using binary search instead of sequential search to find the position of an element to be inserted in the partially sorted subarray. How many comparisons did this modified insertion sort take? Does modifying insertion sort in this manner change the time-complexity order?

Given an array containing the following integers:

3, 26, 67, 35, 9, -6, 43, 82, 10, 54

trace the insertionSort algorithm on this array. How many comparisons did it take to complete the sort?