For these questions, refer to the examples that appear in the chapter.
a. How many calls to RunningSum are made for the call
RunningSum(10)?
b. How about for the call RunningSum(n)? Give your answer in terms
of n.
c. How many calls to MoveDisk are made in the Towers of Hanoi
problem if the initial call is MoveDisk(4, 1, 3, 2)? This call
plays out a four-disk game.
d. How many calls are made for an n-disk game?
e. How many calls to Fibonacci (see Figure 17.13) are made for the
initial call Fibonacci(10)?
f. How many calls are required for the nth Fibonacci number?
g Is a square with a ‘P’ ever encountered at line 12 of the ExitMaze
code?