For the following questions, simplify and express your answer as e(n) or (n* (log n)) wherever possible. If the running time is exponential, then just give exponential lower bounds. Random(n) generates a random number between 1 and n with uniform distribution (every integer between 1 and n is equally likely.) 2. (10 points) Consider the following function: func2(A, n) /* A is an array of integers 1 if (n 28 0; 50) then return (0); 3 for in 1 to [n/2] do 4 5 for is 1 to [n/2] do for is 1 to n do " 6 for is 1 ton do . Alio] Aliol+Alio+is] - Alia] Alix: " 8 9 end 10 end 11 end 12 end 13 Random(15n/7]; 14++func2(A, k); 15 return (s); Random([5n/7]) in Step 11 generates a random number between 1 and [5n/7]. (a) What is the asymptotic worst case running time of func2? Justify your solution. (b) What is the asymptotic expected running time of func2? Justify your solution.