1. Write the recurrence equation of the worst-case time complexity of the following algorithm Xs running time in terms of n. 2. What is the asymptotic upper bound?

int X (int n) {

if(n == 1)

return (1);

else

return (X(n-1) + X(n-1) + X(n-1));

}