Calculate the exact number of merge sort comparisons: between n⌈log₂n⌉ - 2^⌈log₂n⌉ + 1 (best) and n⌈log₂n⌉ - n + 1 (worst). Always O(n log n) regardless of input.
Enter the values for the scenario you are assessing. Calculate the exact number of merge sort comparisons: between n⌈log₂n⌉ - 2^⌈log₂n⌉ + 1 (best) and n⌈log₂n⌉ - n + 1 (worst). Always O(n log n) regardless of input. Use the merge sort operations result to inform your calculation.