NOTE: I'm not asking for you do the charts just asking for help with the code. Also probably be the easiest using Python

Implement the following 1) Implement Mergesort algorithm; run the program on nine different arrays of real numbers, Array 1, Array 2, ..., and Array 9 fill out the following table in an Excel spreadsheet (named Mergesort Time.xls(x) or Mergesort Time.csv) Input size nValue of n. lognTime spent (secondsValue of (n- logn)/time (using for Array i scientific notation: x 10Y, with x or milliseconds or nanoseconds) being a rounded integer) The size of Array i should be no less than 1000 i, but the actual array sizes are of your choice Elements in each array are also of your choice, and you are highly suggested to use the program to generate random real numbers The Excel spreadsheet needs to be automatically (i.e., by your program) filled out 2) Design an interface that allows the user to choose an arbitrary number i (the value of i is from 1 to 9). The interface will then display the original Array i followed by the sorted Arrayi 3) The interface will keep waiting for the user selection until the user chooses to exit