input: Write a function to solve the "Tower of Hanoi" game for any number of disks using a recursive algorithm. The function should take the number of disks and the names of the three rods as parameters and print the sequence of moves required to solve the problem. If there is only one disk, it should print a single move from the start rod to the end rod.
  assert solveTowerOfHanoi(1)
  assert solveTowerOfHanoi(2)
  assert solveTowerOfHanoi(3)
  assert solveTowerOfHanoi(4)
  assert solveTowerOfHanoi(5)
output: def solveTowerOfHanoi(n, start='A', auxiliary='B', end='C'):
      if n == 1:
          print(f"Move disk 1 from {start} to {end}")
          return
      solveTowerOfHanoi(n-1, start, end, auxiliary)
      print(f"Move disk {n} from {start} to {end}")
      solveTowerOfHanoi(n-1, auxiliary, start, end)