PLEASE 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 (e) So, for fairness purposes what we need to do is have tables that they occupy the same amount of memory. How big should the open addressing table be? Express the size as a function of m (the size of the chaining table) and n (the number of elements inserted in the table)