Answer each of the following; no explanations required.

a.A rehash operation in an open addressing hash table where quadratic probing is used to resolve collisions. Assume original tablesize = 3N (before re-hashing), new tablesize = N and there are currently N items in the hash table.

b.Find in a separate chaining hash table where each bucket points to a binary search tree. Assume: tablesize N and there are currently N items in the hash table.

c.Find the maximum value in hash table where linear probing is used to resolve collisions. Assume: tablesize = N and there are currently N items in the hash table