Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Recursionmedium
0:00.0

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