will give thumbs up, thanks!

Algorithm Design 11. K-way merge: Suppose you are given k sorted arrays of comparable items. Suppose that the total number of items from all the lists is n. Design an order O(n log k) time algorithm to merge the k lists into 1 single length n list in sorted order 12. Product Problem: Suppose you are given a size n array A of numbers. Design an algorithm to compute the size n array B defined such that Bli] A[OJ*A[1 ] *...Ai-1]*A[i+1]*. .AIn-1]. That is, B[i] is the product of all elements of A except for element A[i]. Further, you must compute B without using division, and your algorithm must run in O(n) time