1. [12 pts] Consider the following method:

public int recursive1( int n, int k ) {

if ( n == 1 ) {

return k;

}

else {

return ( recursive1( n/2, k++ ) );

}

}

Part A [5 pts]: Write the recurrence equation for T(n), that is, the running time of this method as a function of input value n. Assume that all arithmetic operations and comparisons take constant time. No justification is required.

Part B [7 pts]: Solve the above recurrence equation. Show your work. (A correct solution to an incorrect equation, properly justified, will be worth up to 5 points).