Given an array A of n arbitrary integers, design an O(n)-time algorithm for finding an integer that cannot be formed as the sum of two integers in A. Write the java method that implements this algorithm and the main method to test it.
Hint: The sum of every two integers in A is always less or equal to twice the maximum element.
