The bottom of the stack, where n=0, is called the base case. It does not make a recursive call, so there are no more frames. As an exercise, draw a stack diagram for nLines called with n=4.4.11 Infinite recursionIf a recursion never reaches a base case, it goes on making ...