Towers Of Hanoi

Write hanoi(n: int, source: str, target: str, spare: str) -> None that prints every move needed to transfer a tower of n disks from the source peg to the target peg, one move per line in the form Move disk 1 from A to C, where disk 1 is the smallest and only a smaller disk may sit on a larger one. The recursive plan: when n is 0 there is nothing to do; otherwise move the n - 1 smaller disks from source to spare (using target as the spare for that call), print the move of disk n from source to target, then move the n - 1 disks from spare to target (using source as the spare). Do NOT write a main block or any top-level test code; the tests construct the calls with pegs A (source), C (target) and B (spare). Input: one integer n, no prompt, which the tests read and pass to your function.