You are interested in analyzing some hard-to-obtain data from two separate databases. Each database contains numerical values (so there are 2nvalues total) and you may assumethat no two values are the same. You’d like to determine the median of this set of 2nvalues, which we will define here to be thenthsmallest value. However, the only way you can access these values is through queries to the databases. In asingle query, you can specify a valuekto one of the two databases, and the chosen database will return thekth smallest value that it contains. since queries are expensive, you would liketo compute the median using as few queries as possible. Give an algorithm that finds the median value using at mostO(logn) queries.