2. In this exercise, you will develop a quadratic-time algorithm for the 3-sum problem. When we ask you to design an algorithm, give a crisp and concise English description of your algorithm-don't write Java code Given an integer x and a sorted array all of N distinct integers, design a linear-time algorithm to find if there exists indices i and j such that (a[i] + a[j] =EX) Hint start by checking whether a[O] a[N-1 is smaller than, greater than, or equal to x. Give an efficient algorithm to determine if there exists an integer i such that Ai = i in an array of integer Ai A2