GATE Computer Science (CS) 2019 Solved Papers

There are n unsorted arrays: ${\mathit{A}}_1,{\mathit{A}}_2,...,{\mathit{A}}_{\mathit{n}}$. Assume that $\mathit{n}$ is odd. Each of ${\mathit{A}}_1,{\mathit{A}}_2,...,{\mathit{A}}_{\mathit{n}}$ 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 ${\mathit{A}}_1$, ${\mathit{A}}_2,...,{\mathit{A}}_{\mathit{n}}$ is