Match the sorting algorithms with the appropriate $($worst case$)$ time complexity.

Note: $"^"$ means power. E$.$g$.2^$n means $2-$power$-$of$-$n$.$

Group of answer choices

Bubble Sort

$[$ Choose $]$O$($n$^2)$O$($nlogn$)$O$(2^$n$)$O$($n$)$O$($logn$)$

Heap Sort

$[$ Choose $]$O$($n$^2)$O$($nlogn$)$O$(2^$n$)$O$($n$)$O$($logn$)$

Bucket Sort

$[$ Choose $]$O$($n$^2)$O$($nlogn$)$O$(2^$n$)$O$($n$)$O$($logn$)$

Merge Sort

$[$ Choose $]$O$($n$^2)$O$($nlogn$)$O$(2^$n$)$O$($n$)$O$($logn$)$

Quick Sort

$[$ Choose $]$O$($n$^2)$O$($nlogn$)$O$(2^$n$)$O$($n$)$O$($logn$)$

Insertion Sort