A recursive function has overhead $($performance degradation$)$ that an iterative solution does not, because of what?

Each time the function is called, some CPU time is required to save the state of the machine

The recursive function has to "check for the simplest case" every time it is called, not required in the iterative function

Both of these

Neither of these