1 Sorting Create 3 text files, one with the 50000 integers 1 through 50000 in order, one with the 50000 integers 1 through 50000 in reverse order, and one with 50000 random integers (between 1 and 50000). Write a program to

Read the name of a file

Store the contents of the file into a 50000 element array,

Sort the array using an Insertion Sort, and

Print the actual running time (without any server overhead) of the sort.

Print the number of comparisons used in the sort.

Print just the first 30 values in the resulting array

Turn in a printed copy of the program, along with a printout of the output from three separate runs (using the three text files).

2 Big_OH Notation Consider the following functions:

n+sin(n) 4n² log₃n 3ⁿ 20n 2 log₂n n^2/3

(a) Arrange the six expressions by asymptotic growth rate from slowest to fastest.

(b) Graph the following six functions on a single plot varying n from 1 to 10.

n+sin(n) 4n² log₃n 3ⁿ 2 n^2/3