1) Hashing [40 points) Suppose that we would like to store positive even integer numbers between 1 and 1000 into a dictionary, where the key is the result of the hash function that we apply to the number, and the value is the number itself. a. Consider our hash function is h(x) = x mod 10 and we want to solve possible collisions with chaining. What is the issue here? [10 points] b. Give one suggestion to fix the issue you find in sub question a. [10 points] c. Give the asymptotic complexity of searching an integer value in such a structure. [10 points] d. Suggest a hash function that has faster asymptotic complexity for searching and give its asymptotic complexity. [10 points)