LEASE ANSWER FULL WITH EXPLANATION. I will give UPVOTE!!

PLEASE ANSWER FULL WITH EXPLANATION. I will give UPVOTE!

1. Let's compare the two methods for handling collisions (chaining and open addressing). For ease of calculations lets do the following assumptions: Hash tables will not resize, regardless of their load factor We will use the hash function h(x) = x (for chaining) and h(r,i) = x +i (for open addressing) Indexing should start from 0 (d) Say that each pointer and each element occupies 1 unit of memory. How much memory does each hash table need? Answer this question for any general table (having m buckets and having stored n elements in)