Simon bar Kokhba thinks of an integer between $1$ and $1,000,000($or so he claims$).$ You are trying to determine his number by asking as few yes$/$no questions as possible. How many yes$/$no questions are required to determine Simon$$s number in the worst case? Give both an upper bound $($supported by an algorithm$)$ and a lower bound.