comparing binary search and interpolation search.

Assume a sorted list of integer values is given as input (You can create your own list). The list contains 10,000 numbers. Write a function for finding a number in the list using binary search. Write a second function to look for a number using interpolation search. Write a program to create random numbers in the range of max and min values of the list. Call the first function to find the value in the list (do not print any message). Repeat the search for several thousand times. Now repeat the above test with interpolation search. Compare the average time needed in each case. Discussion: can you think of a case in which binary search works faster than the interpolation search? Do not forget to prepare your report.