Reverse In Place

Write reverse_in_place(values: list[int]) -> None that reverses the list without building a new one: keep two indexes, left starting at 0 and right at the last position, and while left is below right swap the two elements through a temp variable, then move the indexes one step towards each other. This uses O(1) extra space. 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 call your function and then print the same list.