Task: Demonstrate Why Merge Sort Has O(n log n) Time Complexity

Task: Demonstrate Why Merge Sort Has O(n log n) Time Complexity: a task in Terminal-Lego-15k (Harbor dataset). Merge sort is a classic divide-and-conquer sorting algorithm with a worst-case time complexity of O(n log n). Your task is to implement merge sort and create a demonstration that…