A 2-player sport relies on two constructive integers n and okay recognized prematurely to each contributors. Albert has a secret quantity from 1 to n. Bob asks a sequence of ”sure” or ”no” questions in regards to the secret quantity, which can rely on solutions acquired beforehand. Albert could lie or inform reality nevertheless he needs, however he can not lie greater than okay instances in a row. The aim of Bob is discover a quantity m from 1 to n that he is aware of with absolute certainty that it isn’t Albert’s secret quantity. He makes a press release “your quantity shouldn’t be m”, the place m is a few integer from 1 to n. If this assertion is correct, Bob wins. Prove that if n=1025, and okay=10, then Bob has a profitable technique.