Sorted Check By Recursion

Write is_sorted(values: list[int]) -> bool that returns True when every value is less than or equal to the one after it and False otherwise, by recursion: a list of length 0 or 1 is sorted; if the first value is greater than the second the list is not sorted; otherwise the answer is whether the rest of the list, the slice values[1:], is sorted. Do NOT write a main block or any top-level test code; the tests construct the calls. Input: one line of integers separated by spaces (it may be empty), which the tests read into a list and pass to your function before printing the value it returns.