Could someone help with this: Implement a Cuckoo hash table in which two separate tables are maintained. Each table should have a fixed size of 13. Use the hash function h1(x) = x mod 13 for the first table, and h2(x)= 11 (x mod 11) for the second table.

4. [Cuckoo Hashing, 50 points] Implement a Cuckoo hash table in which two separate tables are maintained. Each table should have a fixed size of 13. Use the hash function hi(x) -x mod 13 for the first table, and h2(x)- 11 -(x mod 11) for the second table. Your program should read an input file, input.txt, consisting of one input per line, insert the input to the table in order, and print out the final content of the hash table in the provided format. Your implementation should utilize the provided CuckooHashTable.h file as is, without any edits. Note that the hash tables are is provided, for you to implement. Your program should be able to detect if an insert results in an infinite loop in the hash, and exit with an error message. Sample input.txt file content: 4 27 123 EC330 Applied Algorithms and Data Structures for Engineers, Spring 2018 14 17 195