ADVERSARIAL LOWER BOUND. We are given 3n+2 distinct numbers and are asked to find the (n+1)-st and (2n + 2)-nd smallest using a binary oracle (as in the previous exercise). Describe how you would organize the oracle to obtain a lower bound by the method of adversaries. Your lower bound should be c'n for some explicit constant d (which is not necessarily the same constant as in the previous exercise).