a) draw a diagram illustrating the values as the function is called... and the values as each call is returned....

b) write a non recursive version of this function... using a regular loop.

Let's consider writing a function to find the factorial of an integer, N!. For example 7! equals 7"6 5 4 3"2 1 int myFactorial( int integer) if( integer 1) else return 1; return (integer *(myFactorial (integer-1))) // action performed on call " integer - 1" // action performed on return *