FE-RECURSION-10 If a = 5), how many recursive calls will it take for the program to complete the execution? If the progr

[answerhappygod]

Fe Recursion 10 If A 5 How Many Recursive Calls Will It Take For The Program To Complete The Execution If The Progr 1 (34.68 KiB) Viewed 8 times

FE-RECURSION-10 If a = 5), how many recursive calls will it take for the program to complete the execution? If the program results to an infinite recursion, write INFINITE RECURSION as your answer. 1 2 3 void mystery (int x) 43 ( 5 6 79 9 11 12 #include 16 ( 17 18 19 13} 14 15 int main() int temp; if(x > 0) K 20 21 } temp = x - 1; mystery (temp);l printf("%d\t", x); mystery (temp); int a; scanf("%d", &a); mystery (a); return 0;