Kth Smallest Value

Write kth_smallest(values: list[int], k: int) -> int that returns the k-th smallest value counting from 1, so a k of 1 gives the minimum. Sort a copy with sorted(), because the original list must stay untouched, and index the copy at k - 1. k is always between 1 and the length of the list. Do NOT write a main block or any top-level test code; the tests construct the calls. Input: two lines, a space-separated list of integers and then k; the tests print the value your function returns and then the original list, to show it was not reordered.