An array s[..] stores n distinct numbers such that the first k numbers are smaller than x and the other numbers are larger than x (x a real number). suppose that insertionsort is used to sort s. the number of shifts t made by insertionsort depends on s. find the largest value of t as a function of n and k. argue why.