input: Write a function to solve the "Tower of Hanoi" game for a given number of disks. The function should print the sequence of moves required to move all disks from the starting rod to the end rod using an auxiliary rod. If only one disk is present, it should directly move from the start rod to the end rod.
  
  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 solveTowerOfHanoi(1, 'A', 'C', 'B') == None
  assert solveTowerOfHanoi(2, 'A', 'C', 'B') == None
  assert solveTowerOfHanoi(3, 'A', 'C', 'B') == None
  assert solveTowerOfHanoi(4, 'A', 'C', 'B') == None
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)