Q230
Minimum number of moves required to solve a tower of hanoi problem with n disks is . . . . . . . .
A.
2n
B.
2n-1
AnswerC.
n2
D.
n2-1
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board