int foo (int * array, int N) if (N == 0) return 0; int result = 0; int b, c; for (b = 0; b 1 ; c = c/2) result = result + array [b] * array [c]; return result + foo (array, N-1); Give the recurrence formula (including the base case)