Even in the worst case scenario, the time required to sort data using a binary tree using a self-balancing binary search tree is O(n log n), although this method is still slower than merge sort?

Suppose we are comparing implementations of insertion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n2 steps, while merge sort runs in 32nlogn steps. For which values of n does insertion sort beat merge sort? Group of answer choices: 1. n < 1024 2. n > 1024 3. n < 16 4. n > 16 5. Merge sort is always better since O(nlogn) is better than O(n^2)

Suppose that you sort a large array of integers by using mergesort. Next you use a binary search to determine whether a given integer occurs in the array.  Finally, you display all the integers in the sorted array. Which algorithm is faster, in general: the mergesort or the binary search?  Justify your answer. Which algorithm is faster, in general: the binary search or displaying the integers? Justify your answer.

Pls answer correctly and show all work