(a) What are the three requirements for successful recursion in C++? [3 marks] (b) Please explain...

  

Transcribed Image Text:

(a) What are the three requirements for successful recursion in C++? [3 marks] (b) Please explain the advantages and disadvantages of using recursion instead of an iterative approach. [2 marks] (c) Why does a recursive function use the stack? Please use an example to show how the stack is used in recursion. [4 marks] (d) The digital root of a number is defined as the single-digit number obtained by recursively adding all the digits in the number. For example, The digital root of 12345 is 6, since 1 + 2 + 3+ 4+ 5 = 15, and 1 + 5 = 6. The digital root of 43265132 is 8, since 4 + 3 + 2 +6 +5 +1+3 + 2 = 26, and 2 + 6 = 8. Please write a recursive function digitalRoot that takes an int n and returns the digital root of n. [10 marks] tiv (a) What are the three requirements for successful recursion in C++? [3 marks] (b) Please explain the advantages and disadvantages of using recursion instead of an iterative approach. [2 marks] (c) Why does a recursive function use the stack? Please use an example to show how the stack is used in recursion. [4 marks] (d) The digital root of a number is defined as the single-digit number obtained by recursively adding all the digits in the number. For example, The digital root of 12345 is 6, since 1 + 2 + 3+ 4+ 5 = 15, and 1 + 5 = 6. The digital root of 43265132 is 8, since 4 + 3 + 2 +6 +5 +1+3 + 2 = 26, and 2 + 6 = 8. Please write a recursive function digitalRoot that takes an int n and returns the digital root of n. [10 marks] tiv