Consider the following Algorithm: Factorial (n){ if (n=1) return 1 else return (n * Factorial(n-1)) { Recurrence for the following algorithm is: (A) T(n) = T(n-1) +1 (B) T(n) = nT(n-1) +1 (C) T(n)= T(n-1) +n (D) T(n)=T(n(n-1)) +1â–ºCorrect Option Correct Option is: D