1. Prepare an excel table to compute the runtime for four different algorithms for solving the same problem, for value of N ranging from N=10 to 100 in steps of 10 and then determine the best and worst algorithm. The runtimes of the algorithms are given as below: T1(N)=(1.2)NT2(N)=3N5+200T3(N)=NlgNT4(N)=100N Make sure to attach the excel spread sheet. Also, may be worth to plot the function on excel chart (line plot) and you can show the functions growth. 2. Given three different sorting algorithms to solve a sorting problem and their runtimes are expressed as given below: T1(N)=O(N2)T2(N)=(N2)T3(N)=(N2) Which algorithm should be preferred and which one should not be. Give your answer by using the definitions of the three symbols used. 3. Determine the value of N0 and constant C so that one can expression the following function can be expressed as below f(N)=N2+200N50=O(N2), so that this relation is true for all values of N>=N0 4. Prove that 2n37n+1=(n3) 5. Define a Ct+ function Min that takes an array of floating point numbers X and number of data N ( N is integer) and determines the minimum of all the values and returns the minimum value. Now complete the program by calling this function suitably from main by creating an array with 10 arbitrary values, and call this function and display the minimum value