Which of the following statements are true? ■ Any recursive function can be converted into a nonrecursive function. ■ Recursive functions take more time and memory to execute than nonrecursive...

Which of the following statements are true?
■ Any recursive function can be converted into a nonrecursive function.
■ Recursive functions take more time and memory to execute than nonrecursive functions.
■ Recursive functions are always simpler than nonrecursive functions.
■ There is always a selection statement in a recursive function to check whether a base case is reached.