Worst$-$case for bubble sort isa. O$(1)$b$.$ O$($log$($n$))$c$.$ O$($n$)$d$.$ O$($n$2)$Worst$-$case for selection sort isa. O$(1)$b$.$ O$($log$($n$))$c$.$ O$($n$)$d$.$ O$($n$2)$Worst$-$case for merge sort isa. O$(1)$b$.$ O$($logn$)$c$.$ O$($n$)$d$.$ O$($n$2)$e$.$ None of the aboveWorst$-$case for quick sort isa. O$(1)$b$.$ O$($logn$)$c$.$ O$($ii$)$d$.$ O$($n$2)$Worst$-$case for linear search isa. O$(1)$b$.$ O$($logn$)$c$.$ ii$)$d$.$ O$($ni$)$Average case for heap sort isa. O$(1)$b$.($logn$)$c$.$ O $($ii$)$d$.$ O$($iilog$($ii$))$Worst$-$case deletion in a Binary Search Trae isa. O$(1)$b$.$ O$($log$($n$))$c$.$ O$($n$)$d$.$ O$($nlog$($n$))$Average case for quick sort isa. O$(1)$b$.$ O$($log$($n$))$c$.$ O$($n$)$