#Python code

Merge k sorted arrays into one sorted array in O(n log k) time, where n is the total number of elements in the k arrays. Note: you need to justify that your algorithm runs in O(n log k) time. If your algorithm runs asmptotically more time, you will receive 0 points even if you implement an algorithm correctly that merges k arrays into one sorted array.