1. Modify the binary search routine of Section 3.5 to implement interpolation search. Assume that keys are in the range 1 to 10,000, and that all key values within the range are equally likely to occur.
2. Write an algorithm to find the Kth smallest value in an unsorted array of n numbers