Suppose that we use insertion sort on a randomly ordered array where elements have only one of two values (an example of such array is [1,1,2,1,1,2,2,1,2,1]). What is the running time of the insertion sort in the worst case? Select one: O a. (n) O b. O c. (n.logn) (n)