Suppose S is a sequence of n numbers, each equal to $0$ or $1.$ The worst$-$case time complexity to sort S by MergeSort is $\backslash$Theta $(1())$

$,$ and by randomized QuickSort with $(,,)$

tri$-$partitioning is $\backslash$Theta $(2())$

$,$ where