Hardware Store Database hashing to disk (next pages). Review the following two examples. You are expected to write similar code. Reuse as much code as possible. Example 5-2: (e_5_2_hash.c) - Create an empty hash table of "struct record" - Prompt the user to enter data, hash the key, and insert the data at the index given by the hash function, and repeat, to populate the hash table - Write the hash table to a binary file: we are "cheating" here because we write the hashed table to the file and then pretend that it does not exist so we could demonstrate how to use hash search in a binary file - Collisions are not solved in this example Example 5-7: (e_5_7_hash.c) - A record in the binary file is a "bucket" of 4 structs - This provides room for synonyms - When a bucket becomes full, the records are added at the end of the file in an overflow area.