For each of the following problem s, simplify and express your answer as (nk) or (nk(log n)) wherever possible. 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 Consider the following function: Func1(A, n) A is an array of integers 1 if (n