input: Write a function to solve the Towers of Hanoi game using the given number of disks and rods. The function should print the sequence of moves required to solve the game. If there is only one disk, it should print a single move from the source rod to the destination rod. Otherwise, it should recursively move the top n-1 disks to the auxiliary rod, move the nth disk to the destination rod, and then move the n-1 disks from the auxiliary rod to the destination rod.
  
  ### Input:
  The game consists of 3 rods and 4 disks.
  
  ### 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) 
  
  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)