what is the T(n) recurrence relation and running time complexity for the following:

#1

void FunctionA(int n) { If ( n == 0 ) { output 1 return } for ( int i = 0 ; I < 2ⁿ ; i++ ) { FunctionA(n-1) ; }

#2

void FunctionB(int n) { If ( n == 0 ) { output 2 return } for ( int i = 0 ; i < n; i++ ) { FunctionB(n/2) ; } }