Implement a dynamically resizable hash table to store book names and 10-digit ISBN numbers. Use an initial table size of 11 and a load factor of 0.70. Use the extraction method with division using the last three digits of the ISBN as the first hash address. For a collision, use linear probing. For your testing, make sure you deliberately code ISBNs so that collisions will occur, and demonstrate how the same set of values can result in different hashes, depending on the order in which they are added. Test adding items until the hash table must be resized. Test finding and removing items from the hash table.

IN JAVA, PLEASE