In the problems that follow, you will consider three of the algorithms of search: Ordered-Linear-Search, Chunk-Search, and Binary-Search. Let T1(n), T2(n), and T3(n), respectively, be the number of element examinations required by these algorithms when run on a list whose length is n

i. Suppose that you were given a budget of 20 element examinations. For each of the three algorithms, determine the largest array length such that the number of examinations made is guaranteed to be at most 20.

ii. How many times larger is the array that Binary-Search can handle, as compared to the arrays that Chunk-Search and Ordered-Linear-Search can handle? How many times larger is the array that Chunk-Search can handle, as compared to the array that Ordered-Linear-Search can handle?

T1(n) Ordered-Linear-Search: Chunk-Search Binary-Search = n Tg(n) log2(n)