9.15 A problem exists in normal order evaluation of recursive functions. Describe the problem using as an example the recursive factorial function

int factorial(int n)

{ if (n == 0) return 1; else return n * factorial ( n 1 ); }

Propose a possible solution to the problem, and illustrate it with the above function, using the call factorial(3).