Page 655 - AP Computer Science A, 7th edition
P. 655
9. (B) When x ≤ y, a recursive call is made to whatIsIt(x–1, y). If x decreases at every recursive call, there is no way to reach a successful base case. Thus, the method never terminates and eventually exhausts all available memory.
