Differentiate the recursion and iteration? Draw the diagram to solve the tower of Hanoi problem for n=6 disks. code example

Example: tower of hanoi worst case time complexity

O(2^n) [exponential time]