input: Write a function to solve the Towers of Hanoi game using Python. The function should take four parameters: the number of disks (n), the rod from which to move the disks (fromRod), the rod to which the disks should be moved (toRod), and the auxiliary rod (auxRod). If there is only one disk, the function should print the move to the terminal and return. Otherwise, it should recursively move the top n-1 disks to the auxiliary rod, move the nth disk to the target rod, and then move the n-1 disks from the auxiliary rod to the target rod. If the input is a game with 3 rods and 4 disks, the function should print the sequence of moves required to solve the problem.
  
  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(4, '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)