Consider the following recursive function, write the recurrence equation, solve it, and answer what is the time complexity of this function (in terms of big-O notation)? int funA(int n) { if (n <= 1) return n; return 2*funA(n-1); }