Recursion in Functional Programming

The number of moves required to solve the Hanoi Towers puzzle for $n = 1$ and $n = 2$ disks is equal to $1$ and $3$, respectively. Implement the recursive solution for the Hanoi Towers and count the number of moves for $n=5$ disks.