2. Write out recurrence relations and compute exponential lower bounds for the following functions func1A(A,n) * A = array of n integers if (n S 1) then return A1 3x=0 5 while (i 2 10) d<o 6 AiAi Ali +3 x = x+func 1A(A. i) 8 9 en 10 return (T func1B(A,n) *AarTay of n integers if (n < 1) then return Al 3for i = 1 to n2/2 do 4 | A[i] = Ali]-A[2 * i]
OR
OR