1. Order the following functions by growth rate, from smallest to largest: N,logN,N,log2,2N,NlogN,N3 2. An algorithm takes 0.025ms for input size 1000 . How long will it take for input size 10,000 if the running time is the following (assume low-order terms are negligible)? a. Linear b. O(NlogN) c. Quadratic: 3. Programs A and B are analyzed and found to have worst-case running times no greater than 150Nlog2N and N2, respectively. Answer the following questions. a. Which program has the better guarantee on the running time for large values of N ( N > 100,000)? b. Which program has the better guarantee on the running time for small values of N ( N