Prob: Address book with Hashing.

Design an address book by hash table. (hashing based searching supported)

Requirements:

1)Each record has these five basic items user name, phone number, mobile phone number, address and memo(total spent money ammount)

2) The address book is initialized from a XSV file.

3) use (mobile) phone number and user name item respectively as the keywords and build the index with hashing

4Support searching with the user name and phone number or mobile phone number.

5) Solve the collision.

Note: Please give the full code and write it in C++. Give the XSV file from where the address book is initialized. Mention a short description of the collision and their solving process. Thanks for your help.