Call Stack The function f(n) for the recursive calculation of the factorial according to n! = n -(n - 1)!, with 0! = 1 uses a call stack. Show below how this builds up and unbuilds for the calculation of f(3).

by using C programming language

\begin{tabular}{|l|l|l|l|l|l|l|} \hline & & & & & & \\ \hline & & & & & & \\ \hline & f(2)= & & & & & \\ \hline f(3)=3f(2) & f(3)=3f(2) & & & & \\ \hline \end{tabular}