i have a question about python programming. please give me the correct answer.

Binary search Assuming that you and your friend are playing the game "Guess the number". Your friend will choose an integer in the closed interval [27,1238], i.e. from 27 to 1238 inclusively. Your goal is to guess what the chosen integer is. Every time when you make a guess, your friend will tell you whether your guess is equal to, greater than or less than the chosen integer. If your guess is equal to the chosen number, then the game ends. Having taken the course ENGG1811, you know the best algorithm to use is binary search. For this question, we will assume that you use the binary search algorithm outlined in Part C of the lab and in particular we choose to round down to get the middle element. Assuming that, for a chosen integer, it took you more than 3 guesses to end the game, which one of following sequence of numbers could be your first 3 guesses? Note that there is only one correct answer. 632, 935, 1086 O 632, 935, 1087 O 632, 934, 1086 632. 934. 1087