Discuss the below:
Q: Using hashing , we have to have a program that does the following. It will allow a user to search for books using the ISBN, book title, or author search key. The proper implementation would be to store the actual data in a list, and use separate hash tables for each search key. The value associated with each key is not the book itself, but just the position of the book in the long list of books. We are to assume that there are no duplicates in the search keys.