Please solve this using python (ideally in a Jupyter Notebook).Please also print the results.
(20 pts extra credit) Recall that the MergeSort algorithm (Chapter 2.3 of CLRS) is a sorting algorithm that takes Θ(n logn) time and Θ(n) space. In this problem, you will implement and instrument MergeSort, then perform a numerical experiment that verifies this asymptotic analysis. There are two functions and one experiment to do is (i) MergeSort (A,n) takes as input an unordered
OR
OR