(4 pts) Consider the following function f2. Write a recurrence equation for the running time T(n) of this method as a function of n. Assume that doubling a number takes constant time. Assume that you have already checked that the argument n is positive. (I am not asking you to solve the recurrence relation, just write it.) No explanation required, just T(n) = ". Assume that all arithmetic (+_ *,) takes constant time. int f2( int n) { if ((n == 0 ) 11 (n== 1)) { return n; } else { return ( f(n-1) + f(n/2)); } }