For these questions, refer to the examples that appear in the chapter.
a. How many calls to RunningSu m (see Section 17.2) are made for the call RunningSu m (10)?
b. How about for the call RunningSu m (n) ? Give your answer in terms of n.
c. How many calls to MoveDis k are made in the Towers of Hanoi problem if the initial call is MoveDis k (4, i, 3, 2)1 This call plays out a four-disk game.
d. How many calls are made for an n-disk game?
e. How many calls to Fibonacc i (see Figure 17.13) are made for the initial call Fibonacc i (10) ?
f . How many calls are required for the n th Fibonacci number?
