Python3 help

4-way merge sort runtime analysis. Must be for a 4-way mergesort.

Generate arrays of size n containing random integer

values from 0 to 10,000 to sort. Use the system clock to record the running times of each

algorithm for eleven different values of n where n = 1000, 2500, 5000, 7500, 10,000, 12500, 15000, 17500, 20000, 22500, 25000.

You may need to modify the values of n if an algorithm runs too fast or too slow to collect the

running time data (do not collect times over a minute). Output the array size n and time to the

terminal.

example output:

OUTPUT:- Number of elements: 5000 Time: 6.105737510927788