Hash Table project

This is essentially a simple data structure project. For this project you are to implement the symbol table that will be used by the assembler during pass 1 and pass 2. It should be constructed as an efficient hashing table. You should construct a "main" routine that will invoke the symbol table operations. The main routine should read a file name off the command line. So, I will invoke your project with p1 filename where filename is any name of my chosing. The file will consist of a character string and an optional number one per line. For example the file might look like: moss 25 eno fred gorge 18 The actions should follow the following rules. 1) upon seeing moss 25 hash moss creating a location in an array. if moss already exists, report an error (ERROR moss already exists at location 8) if moss does not exist, store the name and its number 2) upon seeing eno hash eno to find the location in the array where eno may or may not exist. if eno does not exist, report an error (ERROR eno not found) if eno does exist, report the location in the array and its number. (eno found at location 12 with value 433) Clearly, the 12 and 433 are numbers created for this example. You will have one printed line for each input line in the file. You must be able to handle collisions. You must write a hashing function, you may not use one built in the language. You should include appropriate documentation associated with your project in a file called "text" containing name, purpose of project, external files for input and output, and general description of how the problem is solved. You should use a makefile to compile and link your program even if you code in java or other languages. Create good modular code. None of this program should be interactive; no menus, prompts or other action requested by your program should be employed. I will enter make to compile your project that should create an executables called p1. I will invoke your program with p1 fn where fn is any name of a file containing the data as described above.