What is the recursive relation for the Tower of Hanoi problem with nnn disks?
Hn=Hn−1+nH_n = H_{n-1} + nHn=Hn−1+n
Hn=2Hn−1+1H_n = 2H_{n-1} + 1Hn=2Hn−1+1
Hn=2Hn−1+nH_n = 2H_{n-1} + nHn=2Hn−1+n
Hn=Hn−1+2nH_n = H_{n-1} + 2^nHn=Hn−1+2n