input: Write a function to solve the Towers of Hanoi game using Python. The game consists of 3 rods and a given number of disks. The function should recursively print the moves required to transfer all disks from the source rod to the destination rod using an auxiliary rod. If the number of disks is 1, it should directly print the move from the source 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) 
  
  n = 4
  TowersOfHanoi(n, 'A', 'C', 'B')
  
  assert TowersOfHanoi(1, 'A', 'C', 'B')==None
  assert TowersOfHanoi(2, 'A', 'C', 'B')==None
  assert TowersOfHanoi(3, '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)