I need to find the time complexity in terms of Big Oh notation for the following program which computes the factorial of a given number: The program goes like this:public int fact(int n){  if (n <=1)    return 1;  else  return n * fact (n-1);}I know that the above program uses recursion but how to derive the time complexity for the above program?
Finding the time complexity of the following program that uses recursion
complexity;recursion;algorithm analysis;big o