input: Write a function to solve the Towers of Hanoi game using Python. The function should take the number of disks and the names of the three rods as input, and recursively print the moves required to transfer all disks from the source rod to the destination rod. If there is only one disk, it should print the move directly 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')
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)