Rectangula Q2(18 points): Running Time and Growth of Functions (a) (10 points) Assume evaluating a function f(n) in the pseudocode below takes O(n) time. i = 1; sum = 0; while (i k) then sum += f(i); i = 2*i; What is the running time (use an asymptotic notation) of the above code? Justify your answer. (b)(8 points) For the following functions, please list them again but in the order of their asymptotic growth rates, from the least to the greatest. For those functions with the same asymptotic growth rate, please underline them together to indicate that. log2 (n!), 3, (log, n)", log, n", (logio n), logion10, vn, 51/2,n