Minimum number of moves required in solving a Tower of Honoi problem with n disks is
If he takes same amount of time for each disk move and solves the problem in least steps possible,
where k is some constant. and
Relation between the times are:
Correct answer is D.