Q$2$: Consider the Quicksort algorithm studied in the class, which of the following is true about it$?$

a$.$ Its worst case time complexity is theta $(logn)$

b$.$ Its worst case time complexity is theta$(nlogn)$

c$.$ Its worst case time complexity is theta$($n$)$

d$.$ Its worst case time complexity is theta $(n^2)$