input: Write a function to solve the Towers of Hanoi game using Python. The function should take the number of disks and three rods as input and print the sequence of moves required to transfer all disks from the source rod to the destination rod using the auxiliary rod. The function should recursively call itself to determine the moves.
  
  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) 
  
  n = 4
  TowersOfHanoi(n, 'A', 'C', 'B')
  
  assert TowersOfHanoi(3, 'A', 'C', 'B')==None
  assert TowersOfHanoi(2, 'A', 'C', 'B')==None
  assert TowersOfHanoi(1, '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)