Optimal execution time for Tower of hanoi problem with ‘n’ disks is.......

 

Answer: T(n) = 2T(n-1) + 1

Optimal execution time for Tower of hanoi problem with ‘n’ disks is T(n) = 2T(n-1) + 1