1. Code and run Insertion Sort and Mergesort in Python. Use the Time module found at Runestone. Conduct experiments to assess the relative performance of these two algorithms in a simple application that reads a large array. Compare the performance of the mentioned algorithms in terms of input size n and time in milliseconds. The number of input should grow exponentially, such that the range of you input should grow exponentially. If your first dataset is 2^10 (you can start with a larger data set) floating point numbers, the next is 2^11, etc... Make sure to get to sufficiently large data sets such as 2^30. Remember you can create your datasets with random numbers and the redirect to a file (>). python rand.py > somefile.py. Write a brief report with your conclusions to compare the time complexity of the two algorithms. Give the sizes of the data being inputed and make a graph of the time differences. What can you conclude? The graph includes both sorting algorithms and can be made in Excel, in Desmos or you can use Python modules to create graphs. A hand drawn graph is acceptable.

Note: Python Programing