Problem 5 l4 pointsi Suppose you have the following hash table, implemented using linear probing, and the hash function hfkj = k. D 1 2 3 4 5 E-

I need help solving all the parts in the question attached. Thanks.

Problem 5 l4 pointsi Suppose you have the following hash table, implemented using linear probing, and the hash functionhfkj = k. D 1 2 3 4 5 E- "J" B 9 13 12 3 14 4 21 {a} Which sequenceis} of elements, when added in the order given, oould have produced this hashtable? Assume that the hash table has never been resized, and no elements have been deleted.Merl: on “X” by each order you choose. 9, 14, 4, 18, 12, 3, 21 12, 3, 14, 18, 4, 9, 2112, 14, 3, 9, 4, 18, 21 9, 12, 14, 3, 4, 21, 1312, 9, 18, 3, 14, 21, 4 [b] If we want a hash table that stores a set of strings, would the hash function hfkj = kJength [wherek.length is naturally the length of the string id be a good one to use?Just or answer in 20 words or less. {c} Now suppose you implemented a hash table using separate chaining, storing r1keys in a table of size M. Using appropriate asymptotic. notation in terms of n and :lM as necessary, how much time would he required to print out all of the keys inthe table?