input: Write a function to solve the Towers of Hanoi game using recursive approach. The function should take the number of disks `n`, the source rod `fromRod`, the destination rod `toRod`, and the auxiliary rod `auxRod` as parameters. The function should print the sequence of moves required to transfer all disks from the source rod to the destination rod following the rules of the game. If there is only one disk, it should directly print the move.
  assert TowersOfHanoi(3, 'A', 'C', 'B')==None
  assert TowersOfHanoi(2, 'A', 'C', 'B')==None
  assert TowersOfHanoi(1, 'A', 'C', 'B')==None
output: def TowersOfHanoi(n, fromRod, toRod, auxRod):
      if n == 1:
          print(f"Move disk 1 from rod {fromRod} to rod {toRod}")
          return
      TowersOfHanoi(n-1, fromRod, auxRod, toRod)
      print(f"Move disk {n} from rod {fromRod} to rod {toRod}")
      TowersOfHanoi(n-1, auxRod, toRod, fromRod)