Please answer this using loop invariant and induction!

Consider the following problem. Given a sorted array an of integers and an integer T, determine if there exist two integers in the array (possibly the same integer) whose sum equals T. We discussed the following algorithm in the lecture. Input: Array a, Integer T left = 1; right = length of the array; while Cleft right) x a [left] + alright] if (x- T) return true; if (x == T) left if (x