You are given an array A[1n] of arbitrary integers and another integer u. The problem is to check if the array A has two elements x and y such that x+y=u. Present an algorithm to solve this problem. What is the run time of your algorithm? Note: you should try to design an algorithm that is more efficient than the simple brute-force algorithm