Guessing problem.

Write a program which accepts a number, between $0$ and $128,$ from player $1$ and then accepts guesses from player $2.$ If player $2\text{'}$s guess is above or below player $1\text{'}$s number, print out a message, "too high" or "too low" respectively.

When you implement this program, you have to have at least one function using "jal" instruction to call it$.($e$.$g$.$ you may have a function that determines which one is larger or smaller between $2$ numbers.$)$

When the number is guessed correctly, the program will display a message "correct" and the number of tries. Exclude the numbers $0$ and $128.$

How many tries are required to guarantee a solution? $($HINT: binary search$)$ Discuss your answer in the "Comments" section in your code.