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 steps required to move all disks from the source rod to the destination rod using the auxiliary 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(1, 'A', 'C', 'B')==None
  assert TowersOfHanoi(2, 'A', 'C', 'B')==None
  assert TowersOfHanoi(3, 'A', 'C', 'B')==None
  assert TowersOfHanoi(4, 'A', 'C', 'B')==None
  assert TowersOfHanoi(5, 'A', 'C', 'B')==None
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)