Please show steps clearly

For the following questions, simplify and express your answer as (nk) or (nk(logn)) wherever possible (showing an explicit value of k ). 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. Consider the following function: func2(A,n) /A is an array of integers 1 if (n10) then return (0); 2s0 3 for i1 to n/3 do 4 for j1 to n/3 do 10 end 11kRandom(n1) 12ss+func2(A,k) 13return(s) (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