Describe the most time-efficient way to implement the operations listed below. Assume no duplicate values and that you can implement the operation as a member function of the class with access to the underlying data structure. Then, give the tightest possible upper bound for the worst case running time for each operation in terms of N.

Given an open addressing hash table where linear probing is used to resolve collisions, what is the worst case run time of a rehash operation. Assume that original tablesize = N (before re-hashing), new tablesize = N and there are currently N items in the hash table. Explanation:

Given a hash table that uses separate chaining where each bucket points to a linked list that is sorted from low to high, what is the worst case run time to find what the minimum value in the hash table is (you do not know what this value is ahead of time). Assume: tablesize N and there are currently N items in the hash table. Explanation:

Finding an element in a hash table containing N elements where separate chaining is used and each bucket points to an unsorted linked list. The table size = N. Explanation:

Finding what the maximum value is in a hash table currently containing N elements, the hash table is of tablesize N. The hash table uses open addressing and double hashing to resolve collisions. Explanation:

Finding an element in a hash table containing N elements where separate chaining is used and each bucket points to an AVL tree. The table size = N. Explanation: