(Solved) : Answer Following Explanation Rehash Operation Open Addressing Hash Table Quadratic Probin Q26674299 . . . .

Answer each of the following; with an explanation

a.       A rehash operation in anopen addressing hash table where quadratic probing is used toresolve collisions. Assume original tablesize = 3N (beforere-hashing), new

tablesize = N³ and there are currently N items in the hashtable.

b.       Find in a separatechaining hash table where each bucket points to a binary searchtree. Assume: tablesize N² and there are currently N items in thehash table.

c.        Find the maximumvalue in hash table where linear probing is used to resolvecollisions. Assume: tablesize = N⁵ and there are currently N itemsin the hash table.

Expert Answer

An answer will be