express your answer as (nk ) or (nk (log n )) wherever possible.

But if the asymptotic 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.) CoinFlip() returns heads or tails with equal probability.

Write Out Answer By Hand

Func2(A, n) /*A is an array of integers 2 k Random(n); 3 if (k log2(n)) then for i 1 to n do 5 6 7 8 9 while (j n) do ss+A[i] * A[j]; 2A9.AU1 end 10end 11 end 12 else 14while (j 21) do ss+A[i] * A[j]; 15 16 17en