Perform complexity analysis for the algorithm by

1) find the recurrence equation;

(2) solve the recurrent equation and

(3) conclude on the complexity class for the algorithm by a proof.

Include how the recurrence equation is derived, how it is solved and prove the asymtotic complexity.

Analyze the number of multiplications in terms of n.

int sumFactorials(n) { // get the sum from factorial(1) to factorial(n) // n is a positive integer

if (n == 1) return 1;

else { f = 1;

for (j = 2 to n) f = f* j;

return f + sumFactorials(n-1);

}

}