created and stored in the corresponding chain if we were to include second link within the same nodes used in the chains to store the colors and color countswe can then easily add each node to separate linked list this list can then be used to provide complete traversal over the entries in the histogram without wasting time in visiting the empty elements of the - array the implementation of the color histogram is left as an exercise ** ** colorlist figure the individual chain nodes are linked together for faster traversals exercises assume an initially empty hash table with entries in which the hash function uses the division method show the contents of the hash table after the following keys are inserted (in the order listed)assuming the indicated type of probe is used (alinear probe (with (blinear probe (with (cquadratic probe (ddouble hashing [with hp(key(key (eseparate chaining