Power Of Two By Halving

Write is_power_of_two(n: int) -> bool that returns True when a non-negative integer is a power of two (1, 2, 4, 8, ...) and False otherwise, by recursion: 1 is a power of two; 0 is not, and neither is any odd number above 1 (test with the remainder operator %); for every other number the answer is whether n // 2 is a power of two. 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.