2. The creators of Monopoly have decided to create a new version of the game in which two players are allowed to merge their respective assets. Suppose Nina and Lena realize that such a union would benefit them. Each of them has n properties, and they keep the property deeds sorted in increasing order of value. Here we assume that no two properties have the same value. The bank allows them to become one player, and, in return, asks for the deed to the property which would have the median value in the new sorted set of properties(clearly this set would have 2n properties). So far, after receiving the two sets of deeds which were each sorted in increasing order, they needed to spend O(n) time to find this property. Suppose that you are playing the role of this bank. Could you help them find the property with the median value in (log n) time? Provide an algorithm to solve this