What is the number of moves required in the Tower of Hanoi problem for k disks?

• A. 2k – 1
• B. 2k + 1
• C. 2k + 1
• D. 2k – 1