input: Write a function to solve the Towers of Hanoi game for a given number of disks and three rods. The function should print the sequence of moves required to move all disks from the source rod to the target rod.
  
  def TowersOfHanoi(n, fromRod, toRod, auxRod): 
      if n == 1: 
          print("Move disk 1 from rod", fromRod, "to rod", toRod) 
          return
      TowersOfHanoi(n-1, fromRod, auxRod, toRod) 
      print("Move disk", n, "from rod", fromRod, "to rod", toRod) 
      TowersOfHanoi(n-1, auxRod, toRod, fromRod)
  
  assert TowersOfHanoi(3, 'A', 'C', 'B')
  # Expected output:
  # 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
  
  assert TowersOfHanoi(4, 'A', 'C', 'B')
  # Expected output:
  # 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
  # Move disk 3 from rod A to rod B
  # Move disk 1 from rod C to rod A
  # Move disk 2 from rod C to rod B
  # Move disk 1 from rod A to rod B
  # Move disk 4 from rod A to rod C
  # Move disk 1 from rod B to rod C
  # Move disk 2 from rod B to rod A
  # Move disk 1 from rod C to rod A
  # Move disk 3 from rod B to rod C
  # 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
output: def TowersOfHanoi(n, fromRod, toRod, auxRod): 
      if n == 1: 
          print("Move disk 1 from rod", fromRod, "to rod", toRod) 
          return
      TowersOfHanoi(n-1, fromRod, auxRod, toRod) 
      print("Move disk", n, "from rod", fromRod, "to rod", toRod) 
      TowersOfHanoi(n-1, auxRod, toRod, fromRod)