I have this question Advanced Algorithm Divide and Conquer from the book Algorithm Design by John Kleinberg and Eva Tardos $1.$ You are interested in analyzing some hard$-$to$-$obtain data from two separate databases. Each database contains $\backslash ($ n $\backslash )$ numerical values$-$so there are $\backslash (2\backslash$pi $\backslash )$ values total$-$and you may assume that no two values are the same. You'd like to determine the median of this set of $\backslash (2$ n $\backslash )$ values, which we will define here to be the $\backslash ($ n$^\{\backslash$text $\{$th $\}\}\backslash )$ smallest value.

However, the only way you can access these values is through queries to the databases. In a single query, you can specify a value $\backslash ($ k $\backslash )$ to one of the two databases, and the chosen database will return the $\backslash ($ k$^\{\backslash$text $\{$th $\}\}\backslash )$ smallest value that it contains. Since queries are expensive, you would like to compute the median using as few queries as possible.

Give an algorithm that finds the median value using at $\backslash (\backslash$operatorname$\{$most$\}$ O$(\backslash$log n$)\backslash )$ queries.