Consider the following recursive function: void exercise(int x)
{if (x > 0 && x<10){cout ≪ x ≪ “ ”;exercise(x + 1);}What is the output of the following statements?
a. exercise(0);
b. exercise(5);
c. exercise(10);
d. exercise(-5);
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.