What is the recurrence (without solving it) of the following program? Note that parameter n is the size of array A. Just give the recurrence(T(n)), nothing else is needed.

int COMPUTE(int A[], int i, int n) {

if (n == 1)

return A[i];

n1 = n / 2;

n2 = n - n1;

C1 = COMPUTE(A, i, n1);

C2 = COMPUTE(A, n1, n2);

return (C1 * C2);

}