The Following Is an Algorithm for ____

Multiple Choice

The following is an algorithm for ____.
Compute the index by taking the item's hashCode() % table.length.
If table[index] is null
The item is not in the table.
Else if table[index] is equal to the item
The item is in the table.
Else
Continue to search the table by incrementing the index until either the item is found or a null entry is found.

A) rehashing
B) accessing an item in a hash table
C) deleting an item in a hash table
D) inserting an item in a hash table