C program.

You are given a number indicating the number of elements in the hash table implemented by open addressing with double hashing. What is the smallest size of the hash table such that the expected number of collisions is not greater than 21n2? Think about the two criteria we have discussed in class. Your program should read the input from the file, and output the answer to another file. The first argument is the input file name, while the second argument is the output file name. Name your program as lab4-q3.c. Input file: An integer n, indicating the number of elements in the hash table Output file: An integer m, indicating the smallest size of a good hash table Sample Input: 2 Sample Output: 5 5