Explain how to solve the following two problems using heaps. (No credit if youre not using heaps!)First, give an O(nlogk) algorithm to mergeksorted lists withntotal elements into one sorted list.Second, say that a list of numbers isk-close to sorted if each number in the list is less thankpositionsfrom its actual place in the sorted order. (Hence, a list that is 1-close to sorted is actually sorted.) Give an O(nlogk) algorithm for sorting a list of n numbers that isk-close to sorted.