a. Write the formula for the number of steps to perform k sequential searches on a list of size n f(n,k) =

b. Write the formula for the number of steps to perform k binary searches on a list of size n g(n,k) =

c. If we have 10,000 names, how many times do we need to search before Sort+Binary search makes sense (e.g. is less than) over sequential search?

I.e. solve f (10,000,k) < g(10,000,k) (I recommend wolfram alpha!)

c. If we are searching 1,000,000 times, how big does the list need to be to make sorting worth it?

I.e. solve g(n,1,000,000) < f(n,1,000,000)