(4) Consider the following problem. Given: A sorted array A of integers and an integer T. Goal: Determine if there exist two integers in A (possibly the same integer) whose sum equals T. Now consider the following algorithm for the above problem. Input: Sorted array A of integers, integer T. Output: true if there exist two integers in A (possibly the same integer) whose sum equals T; false otherwise. 1 left = 0 2 right = A.length - 1 3 while left T then 10 right -- 11 return false Show that the above algorithm is correct by proving the following statement: At the start of the ith iteration the following conditions hold: left