input: Write a python function to solve the Towers of Hanoi problem and print each move, given the number of disks and the names of the three rods.
  assert towers_of_hanoi(2, 'A', 'B', 'C')==None
  assert towers_of_hanoi(3, 'A', 'B', 'C')==None
  assert towers_of_hanoi(4, 'A', 'B', 'C')==None
output: def towers_of_hanoi(n, source, auxiliary, target):
      if n == 1:
          print(f"Move disk 1 from {source} to {target}")
          return
      towers_of_hanoi(n - 1, source, target, auxiliary)
      print(f"Move disk {n} from {source} to {target}")
      towers_of_hanoi(n - 1, auxiliary, source, target)