1Order the following functions by growth rate : N, N12, N1.5, N2, NlogN, N(logN)2, NlogN22N 2N, 2N2, 37, N3, and N2logN. Also, Indicate which functions grow at the same rate. 2) Describe the order of magnitude of each of the following code sections, using Big-O notation a) static int Square_Root int num) int i-num while(i * i>-num) { b) From Text book 48 (e) count 0; forti-i; i. N; i++) count count+t c) From Texthook 48 (e) value N; count = 0; while (value > I value = value/2; count++ Consider four programs-A, B, C, and D-that have the following performances: A- O(logrn) B-O(n) 3) D-0(2n If each program requires 10 seconds to solve a problem of size 1000, estimate the time required by each program for a problem of size 2000