input: Write a function to solve the Tower of Hanoi problem and print the moves.
  assert move_towers(2, 'A', 'C', 'B')==None  # Should print the steps to move 2 disks from A to C using B as auxiliary
  assert move_towers(3, 'A', 'C', 'B')==None  # Should print the steps to move 3 disks from A to C using B as auxiliary
  assert move_towers(1, 'A', 'C', 'B')==None  # Should print the step to move 1 disk from A to C
output: def move_towers(n, source, target, auxiliary):
      if n == 1:
          print(f"Move disk 1 from {source} to {target}")
          return
      move_towers(n - 1, source, auxiliary, target)
      print(f"Move disk {n} from {source} to {target}")
      move_towers(n - 1, auxiliary, target, source)