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