input: Write a function to solve the "Tower of Hanoi" game for a given number of disks, using three rods (start_rod, end_rod, and aux_rod). The function should print the sequence of moves required to solve the problem for the specified number of disks.
  assert solveTowerOfHanoi(num_disks=1, start_rod='A', end_rod='C', aux_rod='B')
  assert solveTowerOfHanoi(num_disks=2, start_rod='A', end_rod='C', aux_rod='B')
  assert solveTowerOfHanoi(num_disks=3, start_rod='A', end_rod='C', aux_rod='B')
  assert solveTowerOfHanoi(num_disks=4, start_rod='A', end_rod='C', aux_rod='B')
output: def solveTowerOfHanoi(num_disks, start_rod, end_rod, aux_rod):
      if num_disks == 1:
          print(f"Move disk 1 from rod {start_rod} to rod {end_rod}")
          return
      solveTowerOfHanoi(num_disks-1, start_rod, aux_rod, end_rod)
      print(f"Move disk {num_disks} from rod {start_rod} to rod {end_rod}")
      solveTowerOfHanoi(num_disks-1, aux_rod, end_rod, start_rod)