Please give explanation why you chose your answer so I can compare with answer I chose to see difference if there are any. Thanks will give good feedback

Question 3 1 pts Consider the same problem as above: Suppose we have k sorted lists, each with exactly n elements, that we would like to merge (so we end up with a sorted list of length kn). This time, we do a k way merge, as follows: we maintain a binary min-heap of size k, containing the smallest elements from each of the k input lists. Now, we proceed for kn iterations in each iteration, we extract the minimum element from the heap and add it to the output array. Then we delete the corresponding element from the input list where it came from, and insert the new smallest element from that list to the heap. What is the overall running time of this algorithm (in big-Theta notation k2n. 2 kn log (k) kn. k2n