input: Write a function to solve the "Tower of Hanoi" game for a given number of disks, using three rods labeled 'A', 'C', and 'B'. The function should print the sequence of moves to solve the problem. If the number of disks is 1, it should directly move the disk from the start rod to the end rod. For more disks, it should recursively move the top disks to the auxiliary rod, move the bottom disk to the end rod, and then move the disks from the auxiliary 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) 
  
  # Example usage
  num_disks = 4
  solveTowerOfHanoi(num_disks)
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)