Problem $6$: Log It $(10$ points$)$ Use API

$($Data Structure Algorithms$)$ High$-$Low is a simple number guessing game where one player thinks of a

random integer number between $0$ to some maximum value and another player attempts to guess that

number. With each turn, player one tells player two whether their guess was correct, too high, or too low.

The optimal strategy for playing this game is to select the middle value between the largest and smallest

possible numbers. In Computer Science, this strategy is called a Binary Search Algorithm. Binary search

algorithms eliminate half the possible search space with each pass. Your task is to determine the

maximum number of tries it takes to guess the number correctly using the Binary Search algorithm. This

can be determined by taking the log$2$ value of the maximum number. Since this result represents the max

number of guesses round any fractional result up to the next highest integer.