I need complete solution for this question

Its from Algorithms and Complexity

4 Sum of two numbers You are given an array All...n] of arbitrary integers and another integer u. The problem is to check if the array A has two elements x and y such that z + 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 5 Heap Reca in class I described how one can merge two sorted lists into a single sorted list. Now suppose you are given k sorted lists with n elements in total, and you want to merge these k sorted lists into a single sorted list. Now give an O(nlogk) algorithm for this problem. Hit: use a heap for k-way merging