Hanoi Move Count

Complete hanoi_moves(n: int) -> int so it returns the smallest number of moves needed to solve the Towers of Hanoi puzzle with n disks. The base case is written: zero disks need 0 moves. Add the recursive case: moving n disks means moving the n - 1 smaller disks aside, moving the largest disk once, then moving the n - 1 disks back on top, so the answer is twice the moves for n - 1 disks plus one. Do NOT write a main block or any top-level test code; the tests construct the calls. Input: one integer n, no prompt, which the tests read and pass to your function before printing the value it returns.