Answer
Any recursive function can be converted into a nonrecursive function. - True
Recursive functions take more time and memory to execute than nonrecursive functions. - True
Recursive functions are always simpler than nonrecursive functions. - False
There is always a selection statement in a recursive function to check whether a base case is reached - True
Work Step by Step
The first statement is true because any recursive function can be converted into a iterative function.
The second statement is true because recursive function have to maintain all previous states in it's recursive stack which costs time and memory.
The third statement if false because several iterative function can be very simpler than their recursive version.
The fourth statement is true because without a selection statement the recursion function will go into infinite recursion.
