Need explain!!!! Thanks!!!

EXAM 2 Fall 2016, Page 10 of 10 CS 2413 Data Structures Short Answer Question 4: Linear Hashing (10 points) the hash table during and after A. Given the following items to insert into a hash table that uses linear hashing, show all items have been inserted. (That is, rather than erasing when things change, cross them out as they I can still see them.) The items are to be inserted starting from the top of the list and working down. The collision resolution strategy is separate chaining. Hash Table Items to Insert Bucket Number Item Item Key A 0110 B 0111 C 0011 D 1001 E 1010 1011 G 1110 o1O A ool C 1101 B. Calculate the load factor after all of the items have been inserted. Show your work. 9 items rous C. Calculate the average number of probes needed for successful search over all of the keys in the original item set, after all of the items have been inserted. Show your work. items EXAM 2 Fall 2016, Page 10 of 10 CS 2413 Data Structures Short Answer Question 4: Linear Hashing (10 points) the hash table during and after A. Given the following items to insert into a hash table that uses linear hashing, show all items have been inserted. (That is, rather than erasing when things change, cross them out as they I can still see them.) The items are to be inserted starting from the top of the list and working down. The collision resolution strategy is separate chaining. Hash Table Items to Insert Bucket Number Item Item Key A 0110 B 0111 C 0011 D 1001 E 1010 1011 G 1110 o1O A ool C 1101 B. Calculate the load factor after all of the items have been inserted. Show your work. 9 items rous C. Calculate the average number of probes needed for successful search over all of the keys in the original item set, after all of the items have been inserted. Show your work. items