input: Write a python function to implement the Tower of Hanoi problem and print the steps of moving discs.
  assert hanoi(1, 'A', 'B', 'C') == None  # Should print "Move disc 1 from A to C"
  assert hanoi(2, 'A', 'B', 'C') == None  # Should print the steps for 2 discs
  assert hanoi(3, 'A', 'B', 'C') == None  # Should print the steps for 3 discs
output: def hanoi(n, source, auxiliary, target):
      if n > 0:
          hanoi(n-1, source, target, auxiliary)
          print(f"Move disc {n} from {source} to {target}")
          hanoi(n-1, auxiliary, source, target)