Problem. Merge K arrays (20 points). Given total of k queues of integers, each sorted in increasing order. Write a function that merges k queues into a single vector, in which all integers are in increasing order. Your function takes two parameters: 1) vector > containing k queues of sorted integers, and 2) vector> &A, vector&result)