some simple numerical programs epsilon numguesses low high max( xans (high low)/ while abs(ans** >epsilonprint 'low ='low'high ='high'ans ='ans numguesses + if ans** xlow ans elsehigh ans ans (high low)/ print 'numguesses ='numguesses print ans'is close to square root of' figure using bisection search to approximate square root when runit prints low high ans low high ans low high ans low high ans low high ans low high ans low high ans low high ans low high ans low high ans low high ans low high ans low high ans numguesses is close to square root of notice that it finds different answer than our earlier algorithm that is perfectly finesince it still meets the problem statement more importantnotice that at each iteration the size of the space to be searched is cut in half because it divides the search space in half at each stepit is called bisection search bisection search is huge improvement over our earlier algorithmwhich reduced the search space by only small amount at each iteration let us try again this time the program takes only thirty guesses to find an acceptable answer how about it takes only forty-five guesses there is nothing special about the fact that we are using this algorithm to find square roots for exampleby changing couple of ' to 'swe can use it to approximate cube root of nonnegative number in the next we will introduce language mechanism that allows us to generalize this code to find any root finger exercisewhat would the code in figure do if the statement were replaced by -