input: Write a function to solve the Towers of Hanoi game using Python. The game consists of three rods and a specified number of disks. The function should print the sequence of moves required to move all disks from the source rod to the destination rod using the auxiliary rod. If there is only one disk, the function should print the move directly to the destination rod. For more than one disk, the function should recursively solve the subproblems by moving n-1 disks to the auxiliary rod, moving the nth disk to the destination rod, and then moving 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) 
  
  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)