Challenge: Solve Hanoi recursively

Explore how to use recursion to solve the Towers of Hanoi puzzle by writing a function that moves disks between pegs. Learn to implement the base case and apply recursion to handle multiple disks effectively.