- PART 2 - Exercise 3: Advanced Hashing. Based on the case study in Part 2, apart from BIB number, participant information also contains a name (string), category (int), and runtime (int). The default value for runtime is 0 (represent minutes). Represent the above additional information in a data structure (e.g. struct) and also creating a HashTable that stores the key (BIB number). a. Implement the hashing functions created in Part 2 for this problem. It may need to be modified to suit this problem. You can accept up to 10 inputs from the user or read from a formatted text file of participant information. b. Suppose that a linked list is used as a data structure, create the hashing function that will handle any collision to create the next linked list (bucket) in the specified collision index rather than using linear probing as in the previous hashing function (Part 2)