Two Sum By Brute Force

Write two_sum_brute(values: list[int], target: int) -> tuple[int, int] that returns the indexes (i, j), with i before j, of the first pair of values that add up to target, trying every pair with two nested loops over indexes; return (-1, -1) when no pair works. This is O(n squared). 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 the target; the tests print the tuple your function returns.