Compito๐ shown in EN
๐ **Task:** Write `pair_sum_sorted(arr, target)` that returns `[i, j]` (indices) of the first pair in the sorted list `arr` that sums to `target`, or `[]` if no such pair exists. Then test with `pair_sum_sorted([1, 2, 4, 7, 11], 9)` and print the result.
๐ Implement the function above. Test cases run automatically.
๐ก **Hint:** Re-read the theory if you get stuck โ the pattern is right there.