input: Write a function to solve the Towers of Hanoi game using Python. The function should print the series of moves to solve the game for a given number of disks and 3 rods. The input to the function will be the number of disks and the names of the three rods. If there is only one disk, it should print a single move from the source rod to the destination rod. For more than one disk, it should recursively move the top n-1 disks to an auxiliary rod, move the nth disk to the destination rod, and finally move the n-1 disks from the auxiliary rod to the destination 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(0, '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)