Page 1310 - AP Computer Science A, 7th edition
P. 1310
14. (B) Since n == 6 fails the two base case tests, method call mystery(6) returns 6 + mystery(5). Since 5 satisfies the second base case test, mystery(5) returns 5, and there are no more recursive calls. Thus, mystery(6) = 6 + 5 = 11.
