Please hand draw the recursive trees to these problems

(i) Fibonacci sequence is recursively defined as follows: Fib(0)-O, Fib(1)-1 Fib(n) Fibn-1)Fib(n-2) for n 2 For Fib(5), draw the recursive tree diagram as shown in class (i) Tower of Hanoi problem: Draw the recursive tree diagram for Tower of Hanoi with 4 disks