6 - What is the recursive equation of algorithm given below int funx (int n, int x) if (n == 0) return 1; if (n == 1) return x; if ((n% 2) == 0) return funX (n/2, x* x); else return funx (n/2, x* x) * x; a) T(n) = 0 (1) + T (log n) b) T(n) = 0 (1) + T (n/2) c)T(n) = n +T (n/2) D)T(n)= n +T(log n) Leave blank