FE-RECURSION-02 If a = 10, how many times is the recursive function called, when the following code is executed? 1 #include <stdio.h> 2 3 void mystery (int n) 4 ( if(n = 0) MASH 5 6 7 8 9 10 11 12 int main() 13 14 15 MARRA 567 16 17 18 O 9 O 10 O 12 printf("%d ",n); mystery (n-1); 11 int a; scanf("%d", &a); mystery (a); return 0; Answer is not among the choices
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!