input: Write a function to solve the "Tower of Hanoi" game for a given number of disks. The function should take the number of disks and the names of the start, end, and auxiliary rods as input and print the sequence of moves required to solve the game. If there is only one disk, it should move directly from the start rod to the end rod.
  assert solveTowerOfHanoi(2)
  assert solveTowerOfHanoi(3)
  assert solveTowerOfHanoi(4)
  assert solveTowerOfHanoi(1)
  assert solveTowerOfHanoi(0)
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)