Let f(n) be a function that returns the factorial of a number n.if f(n) is implemented tail recursively and the compiler is capable of optimizing tail recursion,what would be the minimum depth of a stack,at any given time,created by the call f(10)?
a-10
b-11
c-1
d-2
