Answer Happy

Question 10 Which of the following statements is not true? O Using recursion enables you to give a natural, straightforward, simple solution to a program that would otherwise be difficult to solve. O A recursive function takes more time and memory to execute than a nonrecursive function. There is always a selection statement in a recursive function to check whether a base case is reached. Any recursive function can be converted into a nonrecursive function. Recursive functions are always simpler than nonrecursive functions.
Question 6 What does the following code display? int foo (int n) { if (n > 0) { } } } int main() { foo (12345); 54321 O 1234 cout << n % 10; foo (n / 10); O 12345 O 5432 05