Implement a recursive Python function that solves the Tower of Hanoi problem for n disks. The function should print the steps required to solve the puzzle. PLAINFORMAT
def hanoi(n, source, target, auxiliary):
    if n > 0:
        hanoi(n - 1, source, auxiliary, target)
        print(f"Move disk {n} from {source} to {target}")
        hanoi(n - 1, auxiliary, target, source)