How does the computer keep track of all the calls to a recursive function?

What will be an ideal response?

A computer keeps track of recursive calls as follows: When a function is called, the computer plugs in the argument(s) for the parameter(s) and begins to execute the code. If a recursive call should be encountered then suspends the current function, saving all the information necessary to continue this incarnation of the function after the recursive call is done. When the recursive call is completed, the suspended invocation continues. The only limit on the number (or depth) of recursion is machine resources, primarily memory. The process will not terminate unless and until one of the calls to the function does not depend on recursion to return a value.