Design a C Function that creates and fills a hash table. Hash(int* table, int* input, int M, int X); The function should look like this where table = an array used to store the hashed values input =...

Design a C Function that creates and fills a hash table.

Hash(int* table, int* input, int M, int X);

The function should look like this where

• table = an array used to store the hashed values


• input = an array of integers


• M = length of both the input array and hash table.


• X = value used for the double hash


• Double hashes will handle the collisions.


• The function needs to implement these hashes:


• h(k) = (h₁(k) + h₂(k)*i) mod M, where i=1:M, or i=0:M


• h₁(k) = k mod M


• h₂(k) = X - (k mod X)