Consider the following problem. Given a sorted array a 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 (left T) right-;} return false; Show that the above program is correct by using loop invariant. Describe a loop invariant and prove it using induction