Help with Complexity analysis: Represent the time complexity of the following recursive algorithm, T(n), as a recurrence equation.

int pow_2( int n ){ if ( n==1) return 2; if ( n > 1) return ( 2 * pow_2( n-1 ) ); }