1. An empty hash table has a capacity of 100, and you add six elements with hash codes 100, 0, 1199, 1299, 1399, and 2. Using linear probing and a division hash function, where will these elements be...

1. An empty hash table has a capacity of 100, and you add six elements with hash codes 100, 0, 1199, 1299, 1399, and 2. Using linear probing and a division hash function, where will these elements be placed in the table? Where will they be placed with double hashing (with hash2(key) returning the value 1 + (Math.abs(key.hashCode( )) % 98))?