There are n unsorted arrays: A1, A2, ..., An Assume that n is odd. Each of A1, A2, ..., An contains n distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of A1, A2, . An is ptions 1. O(n) 2. O(n) 3.log n) 4. O(n log n)