main findBooks program

uses hash table with nested linked lists to store library lookup info.
Hash keys are book titles, collisions are resolved by chaining into a
doubly linked list, data field of each element contains another doubly
linked list of ints containing the id of each library.  Linked list
module is implemented as generic void * type.