Binary search The problem of table lookup consists in finding, for given X, an integer I such that X lies between TABLE (I) and TABLE (I + I), where TABLE is a given one-dimensional array containing an increasing (or a decreasing) sequence. Write a FORTRAN subprogram which utilizes the bisection method to carry out this search efficiently. How many times does your routine compare X with an entry of TABLE if TABLE has n entries?