Let Moves4(n) denote the number of moves required to move n disks from source pile to destination pile using two helper piles. Moves4(n) can be defined recursively as follows:

Moves4(1) = 1

Moves4(n) = min 1kn1 (2Moves4(k) + 2nk 1) for n > 1 Compute Moves4(4).

Show work