Worst$-$case for bubble sort is

a$.O(1)$

b$.O(log(n))$

c$.O(n)$

d$.O(n^2)$

Worst$-$case for selection sort is

a$.O(1)$

b$.O(log(n))$

c$.O(n)$

d$.O(n^2)$

Worst$-$case for merge sort is

a$.O(1)$

b$.O(logn)$

c$.O(n)$

d$.O(n^2)$

e$.$ None of the above

Worst$-$case for quick sort is

a$.O(1)$

b$.O(logn)$

c$.$ in