Suppose you have a variation of insertion sort that used binary search to find the correct

slot for the ith number among the i $-1$ numbers that have been processed so far. What is

the worst$-$case complexity of this new insertion sort?

A$.\backslash$Theta $($n$)$

B$.\backslash$Theta $($nlog$($n$))$

C$.\backslash$Theta $($n$2)$

D$.\backslash$Theta $($n$2$log$($n$))$

E$.$ none of the above