This is Discrete Math

S. Find a big-O estimate for the worst-case complexity in terms of number of comparisons and number of terms swapped for the binary inscrtion scarch (described in pscudocode bclow). In this algorithm, a binary search is used to locate the position to insert the jth element into a list of the previously sorted j-1 elements. Procedure binary insertion_search (a,a,a.a integers) For j 2 to left right j-1 While left " then left := m + 1 Else right If a,