Which of the following sorting algorithms yield approximately the same worst-case and average-case running time behaviour in O (n log n)?

Option 1 : Bubble sort and Selection sort

Option 2 : Heap sort and Merge sort

Option 3 : Quick sort and Radix sort

Option 4 : Tree sort and Median of- 3 Quick sort

Answer: Option 2