Which of the following statements are true?
■ Any recursive function can be converted into a nonrecursive function.
■ A recursive function takes more time and memory to execute than a nonrecursive function.
■ 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.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.