subject: data structure& algorithms java recommend

Q7 (10pts). Draw the final result after inserting the keys 7, 19, 10, 15, 13, 8, 11, 12 into a hash table with collisions resolved by (a) chaining, (b) linear probing. Let the table have eight slots with addresses starting at 0, and let the hash function be h(k) = k mod 8. Hint: 8 mod 8 = 0; 9 mode 8 = 1 (LO24) (a) Chaining (b) Linear Probing