Data Structure

27. Suppose you design a new sorting algorithm and you run some tests to benchmark the performance on lists of length n. The timing data you collect is below: (a) Asume that the algorithm has axymptotic complexity (nk) for some value of k, then estimate the value of k based on the data. Please show your work. (b) Using your answer for the complexity in part (a), estimate the time required for your algorithm to run on a list of length n=10000. Please show yout work. 28. Suppose you have 10 slot closed hash table for integers with havh function h(k)=k(mod10). Show the resulting lush table after insrting the following sexpenen of values 5210782290822148 using the following probing functions. (a) (linear) p(i)=i (b) (double hashing) p(i,k)=i(h2(k)+1), where h2(k)=k(mod3)