2. Implement the code but with the addition that the code prints out: SOLVE USING PYTHON move light green disk from A to C move green disk from A to B move light green disk from C to B move purple disk from A to C move light green disk from B to A move green disk from B to C move light green disk from A to C def Towers (n, fin, to, spare): if n > 0: Towers (n-1, fih, spare, to) print (filmave disk from {f} to {to}') Towers (n-1, spare, to, fb) Towers (3, "A", "C", "B") 3. Find the number of minimal moves for n disks. Prove that this is the correct number using induction. 4. Analyze the code for Fibonacci numbers below. What is the complexity? Is it good? How can it be improved using a global dictionary? Measure the times using %time it. def fib(x): assumes x an int >= 0 returns Fibonacci of x""" if x == 0 or x == 1: return 1 else: return fib(x-1) + fib(x-2)