3- What is the running time 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) = O(n log n) b) T(n) = O(n) c) T(n) = O(log n) d) T(n) = O(na) Bo brak