private int hash(Key key)

{

return (key.hashCode() & 0x7fffffff) % m;

}

Provide the contents of a linear-probing hash table that results when inserting key the following key value pairs (23, X), (12, M), (8, I), (16, Q), (22, w), (23, N), (65, R), (43, o), (33, G), (56, T) that order into an initially empty table of initial size M = 11 by using the following insertion and resize algorithm. Use the method in the previous question to map a key into a table index