Tower of Hanoi and frog jumping

1. Implementation code: seeking Fibonacci of N items of Number of
   

2. Implementation code: solving the Towers of Hanoi (tips, using recursion)
   Tower of Hanoi is a classic problem. Tower of Hanoi (Hanoi Tower), also known as the Tower of Hanoi, derived from an ancient Indian legend.
   When Brahma created the world to do three diamond pillars, from the bottom up pile with 64 gold discs in order of size to a post. Brahma Brahman command to the disk in order of size from the bottom again placed on the other pillars. And, any time, in a small disk can not be enlarged disc, and one disc can only be moved between the three pillars. Q. How should I do?
   

3. Implementation code: frog jump stairs questions (prompts, using recursion)
   a frog can jump on a Class 1 level, you can also hop on level 2. The frog jumped seeking a total of n grade level how many jumps