Please use an input file and java or C++

3. Implement insertion, deletion and search for a hash table by using the double hashing method as defined in class. Suppose your double hashing is h(k) i + jd(k) mod N and d(k) q-k mod q, then pick q the largest prime less than N. Input format: . command Sample Input: 13 7 18.in 41.in 18.sch 22.in 44.in 45.sch 59.in 32.iin 41.de 31.in 73.in The first and second integers are, N and q values, respectively. Note to that stop your input once the hash table is full. Output: Two sets of outputs to be displayed, one for before the operation, another for after the operation In each set of output, each entry to be displayed on a new line possibly with more than one key. Note that output of a "sch" is to be "found" or "not found" If a duplicate is inserted display "duplicate key". Sample output format: 0:31 2: 4: 5:18 6:32 7:59 8:73 9:22 10:44 12: 3. Implement insertion, deletion and search for a hash table by using the double hashing method as defined in class. Suppose your double hashing is h(k) i + jd(k) mod N and d(k) q-k mod q, then pick q the largest prime less than N. Input format: . command Sample Input: 13 7 18.in 41.in 18.sch 22.in 44.in 45.sch 59.in 32.iin 41.de 31.in 73.in The first and second integers are, N and q values, respectively. Note to that stop your input once the hash table is full. Output: Two sets of outputs to be displayed, one for before the operation, another for after the operation In each set of output, each entry to be displayed on a new line possibly with more than one key. Note that output of a "sch" is to be "found" or "not found" If a duplicate is inserted display "duplicate key". Sample output format: 0:31 2: 4: 5:18 6:32 7:59 8:73 9:22 10:44 12