input: Write a function to solve the "Tower of Hanoi" game for a given number of disks using recursive approach. The function should take the number of disks and the names of the three rods 'A', 'C', 'B' (start, end, auxiliary) as parameters. It should print the sequence of moves to move all disks 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) 
  
  # Test cases
  solveTowerOfHanoi(0) # No output for zero disks
  solveTowerOfHanoi(1) # Move disk 1 from rod A to rod C
  solveTowerOfHanoi(2) # 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) # 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)