Functions and the stack

The stack stores activation records (i.e., stack frames). An activation record is pushed to the stack when a function is invoked. When the function returns, its activation record is popped from the stack. Which of the following statements best describes how the stack maintains its collection of activation records?

Which of the following is NOT stored inside a function's stack frame (i.e., activation record)?

The following function is defined to find the nth number of the Fibonacci sequence:

int Fib(int n) {
  if(n < 3)
    return 1;
  else
    return Fib(n-1) + Fib(n-2);
}