PROBLEM 2 Weiss) We are given an array that contains N numbers. We want to determine if there are two numbers whose sum equals a given number K. For instance, if the input is 8, 4, 1, 6, and K is 10, then the answer is yes (4 and 6). A number may be used twice. First, give an O(n2) algorithm to solve this problem. Then give the pseudocode of an O(n log n) algorithm to solve this problem. (Hint: sort first. You may call a function sort in your pseudocode without defining it and assume it runs in O(n logn).)