input: Write a function to solve the "Tower of Hanoi" game for a given number of disks. The function should output the sequence of moves required to solve the problem by moving disks from the start rod to the end rod using an auxiliary rod. If the number of disks is 1, simply print the move and return. For more disks, recursively move the upper disks to the auxiliary rod, move the nth disk to the end rod, and then move the upper disks from the auxiliary rod to the end rod.
  assert solveTowerOfHanoi(1) == print("Move disk 1 from rod A to rod C")
  assert solveTowerOfHanoi(2) == print("Move disk 1 from rod A to rod B", "Move disk 2 from rod A to rod C", "Move disk 1 from rod B to rod C")
  assert solveTowerOfHanoi(3) == print("Move disk 1 from rod A to rod C", "Move disk 2 from rod A to rod B", "Move disk 1 from rod C to rod B", "Move disk 3 from rod A to rod C", "Move disk 1 from rod B to rod A", "Move disk 2 from rod B to rod C", "Move disk 1 from rod A to rod C")
  assert solveTowerOfHanoi(4) == print("Move disk 1 from rod A to rod B", "Move disk 2 from rod A to rod C", "Move disk 1 from rod B to rod C", "Move disk 3 from rod A to rod B", "Move disk 1 from rod C to rod A", "Move disk 2 from rod C to rod B", "Move disk 1 from rod A to rod B", "Move disk 4 from rod A to rod C", "Move disk 1 from rod B to rod C", "Move disk 2 from rod B to rod A", "Move disk 1 from rod C to rod A", "Move disk 3 from rod B to rod C", "Move disk 1 from rod A to rod B", "Move disk 2 from rod A to rod C", "Move disk 1 from rod B to rod C")
output: def solveTowerOfHanoi(n, start='A', end='C', aux='B'):
      if n == 1:
          print(f"Move disk 1 from rod {start} to rod {end}")
          return
      solveTowerOfHanoi(n-1, start, aux, end)
      print(f"Move disk {n} from rod {start} to rod {end}")
      solveTowerOfHanoi(n-1, aux, end, start)