Find Time Complexity of Recursive Implementation of N!.

RecursiveFactorialAnalysis.cpp

int factorial(int n) {            // T(n)
    if (n <= 1) {                 // 1
         return 1;                // 1
    }
    int temp = factorial(n-1);    // T(n-1)
    return n*temp;                // 1
}