Minimum number of moves required to solve a tower of hanoi problem with n disks is __________

• A. 2n
• B. 2n-1
• C. n2
• D. n2-1