The Tower of Hanoi is a well$-$known problem for studying recursive equations in recursive and discrete mathematics in computer science. We start with N discs of different sizes $($stacked in order according to size$)$ and two empty nails on the nails. We are allowed to move discs from one nail to another, but we are never allowed to move larger discs on smaller discs. The goal is to move all the discs to the rightmost peg