ADVERSARIAL LOWER BOUND. We are given an oracle that takes up to k ≥ 2 inputs for a fixed given k, and returns the maximal element. Using the method of adversaries, derive an exact lowerbound for finding the maximum of n elements that is sharp (attainable) for all n and k. Say why it is sharp.