Develop an algorithm that uses a random number generator which always generates random numbers in the range lower. . . . upper. In each instance the random number generated should take on the role of middle in the above algorithms. Compare the performance of this algorithm with the binary search algorithm in terms of the number of comparisons made.