In this programming assignment you will have the opportunity to study the effects of different hash functions on the efficiency of inserting data into a hash table.2.0 RequirementsThe student shall define, develop, document, prototype, test, and modify as required the software system.2.1 Functional Requirements2.1.1 The software shall include three functions each of which implements a different hash function. Hash functions may be those studied in class or adaptations of those functions.2.1.2 The software shall include three functions each of which implements a different double hash function. One and only one of these double hash functions must be for linear probing, i. e. returns an increment value of 1.2.1.3 Each hash function shall be tested using each of the double hash functions as a means of collision resolution. This means a total of nine tests. A list of 50 4-letter keys, each with some associated data will be provided for the testing.2.1.4 In addition to the regular documentation a written report on the results will also be prepared. This consist of printouts of diagrams of the results of the hash tests and a count of the number of collisions in each test. Sample code can be found in the "Hints" section for producing a diagram.