True or false questions about Sorting, please give explainations, thank you.

Merge Sort is O(n log n). BucketSort is O(n). You should know from previous courses: Insertion sort and BubbleSort are 0(n2) True or false: BucketSort is always preferred over BubbleSort . True or false: MergeSort is always preferred over BubbleSort True or false: MergeSort is always preferred over InsertionSort True or false: BucketSort is O(n) but is not commonly used because it is complex to implement