Hanoi Towers with 2+K towers

• Implement Hanoi’s tower using more than 2+K towers to transfer N discs from tower 1 to tower 2. The number K (greater than 1) of additional towers should be input parameter along with N. Compute the time complexity (i.e. total number of disc moves). The program should output each tower status after each move.

• For example, for 4 discs, and 3 (K=1) towers, tower status after each move should be like below

Initial:- [‘D1’, ‘D2’, ‘D3’, ‘D4’] [] []

Move 1:- [‘D2’, ‘D3’, ‘D4’] [] [‘D1’]

Move 2:- [‘D3’, ‘D4’] [‘D2’] [‘D1’]

Move 3:- [‘D3’, ‘D4’] [‘D1’, ‘D2’] []

//