6. Consider these four implementation approaches for hash tables: . Separate chaining Open addressing with linear probing Open addressing with quadratic probing .Open addressing with double hashing Suppose many items for a hash table are initially hashing to the same table index. Which implementation approach or approaches are likely to lead to very poor performance? Answer: a. b. Suppose many items for a hash table are initially hashing such that the first two hash to index i, the next two to index i l, the next two to index i + 2, etc Which imlementation approach or appr entation approach or approaches are likely to lead to very poor performance? Answer: Suppose you are trying to use various hash table libraries for some data you have, but you are getting poor performance for all of them. What should you do to try to get better hash table performance? Answer: C. 7. Consider inserting data with integer keys shown in the table in that order into a hash table of size 13. illin the keys under Quadratic probing, Double Hashing and Chaining with linked list. Hashing functions: h1(x)-x9613 and h2(x)-11-x9611 Double Linked List | | Quadratic-l-Hashing -1-Chaining 0%13 11-x%11 0 8 12 0 2023 3015 9087 3032 9008 10 1 10 2 12 7063 4 10 55 5 2084 9103 8045 5 7 10 10 12 12 12