Consider a game show where an adversary chooses two distinct numbers a,b E [0,100] such that a b. After the adversary has chosen a and b, he cannot change them. Your aim is to choose the largest of the two numbers. You can ask the adversary to reveal the value of one of the two numbers. after which, you have to make your choice. Devise a strategy that succeeds with probability > 1/2 even when the adversary knows your strategy.