1. a) Implement the tower of Hanoi algorithm using recursion with minimum number of moves possible and show all the movements.

b) Compute(and print) the empirical time it takes for n=3, 4, 5, 10 disks. How about 50 disks? 100 disks? Comment on this.

def towerofHanoi(n,A,B,C): # show all moves # compute/print the running time for different n # time function in python is called as import time t1-time.timeO your function t2-time.time # Execution time, t-t2-t1