input: Write a function to solve the "Tower of Hanoi" game for a specified number of disks using recursion. The function should print the sequence of moves required to solve the problem. The function should take the number of disks and the labels of the start, end, and auxiliary rods as parameters. If the number of disks is 1, it should print a single move and return. Otherwise, it should solve the problem for num_disks-1, make a specific move, and then solve the problem for num_disks-1 again with updated rods.
  
  def solveTowerOfHanoi(num_disks, start_rod = 'A', end_rod = 'C', aux_rod = 'B'): 
      if num_disks == 1: 
          print("Move disk 1 from rod", start_rod, "to rod", end_rod) 
          return
      solveTowerOfHanoi(num_disks - 1, start_rod, aux_rod, end_rod) 
      print("Move disk", num_disks, "from rod", start_rod, "to rod", end_rod) 
      solveTowerOfHanoi(num_disks - 1, aux_rod, end_rod, start_rod) 
  
  # Assert cases
  assert solveTowerOfHanoi(1) == None
  assert solveTowerOfHanoi(2) == None
  assert solveTowerOfHanoi(3) == None
  
  # Print statements (these should be verified manually and assertion can't be used)
  # solveTowerOfHanoi(1) should print:
  # "Move disk 1 from rod A to rod C"
  
  # solveTowerOfHanoi(2) should print (in any order):
  # "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"
  
  # solveTowerOfHanoi(3) should print (in any order):
  # "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"
output: def solveTowerOfHanoi(num_disks, start_rod = 'A', end_rod = 'C', aux_rod = 'B'): 
      if num_disks == 1: 
          print("Move disk 1 from rod", start_rod, "to rod", end_rod) 
          return
      solveTowerOfHanoi(num_disks - 1, start_rod, aux_rod, end_rod) 
      print("Move disk", num_disks, "from rod", start_rod, "to rod", end_rod) 
      solveTowerOfHanoi(num_disks - 1, aux_rod, end_rod, start_rod)