Examine the computation of h, the index of the array for element storage. What does size correspond to?

int h = x.hashCode();

if (h < 0) h = -h;

h = h % size;

		the number of collisions
		the index of an empty hashtable slot
		the number of elements to be stored
		the size of the hashtable