A collection of n key-value pairs (k,m) in which k is a positive integer number in a range [0,N-1] for small enough N. Assume that we may have multiple values for the same keys.

a) if m is a positive number in a range [0,M-1] for some small enough integer M, design a lookup table for storing these items such that the time complexity of search, insert and delete are constant. 

b) if m is an arbitrary integer number, design a lookup table for storing these items such that the time complexity of search is log n.

Answer rating: 100% (QA)

a If m is a positive number in a range 0 M1 for some small enough integer M and you want constant time complexity for search insert and delete you can ... View the full answer