Min Heap Property Check

A min-heap stored in a list has every parent no larger than its children, where the children of index i sit at 2 * i + 1 and 2 * i + 2. Write is_min_heap(values: list[int]) -> bool that returns True when the list satisfies that rule and False otherwise: loop over every index, compute the two child indexes, and whenever a child index is inside the list (below len(values)) and the child's value is smaller than the parent's, the answer is False. Equal values are allowed, and an empty list is a valid heap. Do NOT write a main block or any top-level test code; the tests construct the calls. Input: one line of space-separated integers (possibly empty); the tests print the boolean your function returns.