You have k sorted arrays in ascending order. Find the smallest range (in the best time possible) that includes at least one number from each of the k arrays. We define the range [a,b] is smaller than range [c,d] if b-a d-c or a - here. 2. 1