Ononot — The Tower of Hanoi with n disks follows T(n) = 2T(n-1) + 1 w

Guest Session: 1 Question Remaining. Create Account to save progress.

Recursionmedium

0:00.0

The Tower of Hanoi with $n$ disks follows $T(n) = 2T(n-1) + 1$ where $T(1) = 1$ . How many moves for 3 disks?