4. Implement a binary search function in three substantially different programming languages. In

each program (identical, except for the programming language), carry out the same 10,000,000

unsuccessful searches for eight different-sized arrays, namely arrays of sizes 128, 512, 2048, 8192,

32768, 131072, 524288, and 2,097,152. Measure in each of the three programs the time it takes to

do the 10,000,000 searches for each of the eight arrays. Compare these timings to the theoretical

timings the algorithm binary search provides. Are there differences between the three programs?

Explain your timings and observations!!