The recursive definition of a Fibonacci Number is F(n) = F(n-1) + F(n-2), where F(0)=1 and F(1)=1. What is the stopping case in a recursive function that implements this function?

Which of the following about nested IIf functions is FALSE?

A) When having one IIf function nested inside another, the second IIf function becomes the falsepart of the first IIf function. B) You can create a nested IIf function, allowing you to evaluate a series of dependent expressions. C) When having one IIf function nested inside another, the second IIf function becomes the truepart of the first IIf function. D) A nested IIf function is used when you need to test for multiple conditions.

The ending space and slash in an empty element is optional

Indicate whether the statement is true or false