(Solved) : 1 Mystery 7 1 2 Mystery 4 2 3 Mystery 4 3 4 Mystery 5 3 5 Mystery 5 4 Recursive Tracing Ca Q29902766 . . .
1) mystery(7, 1)
2) mystery(4, 2)
3) mystery(4, 3)
4) mystery(5, 3)
5) mystery(5, 4)
Recursive Tracing For each of the calls to the followingrecursive method below, indicate what value is returned:
public static int mystery(int n, int k) {
if (k == 0 || k == n){
return 1; }
else if (k > n) {
return 0; }
else {
return mystery(n – 1, k – 1) + mystery(n – 1,k);
} }
Expert Answer
Answer to 1 Mystery 7 1 2 Mystery 4 2 3 Mystery 4 3 4 Mystery 5 3 5 Mystery 5 4 Recursive Tracing Ca Q29902766 . . .
OR