3. (20 points) suppose we wish to search a linked list of length n, where each element contains a key k along with a hash value h(k). each key is a long character string. how might we take advantage of the hash values when searching the list for an element with a given key?

Alternatively we produce a complex (hash) value for key which mean that "to obtain a numerical value for every single string" that we are looking for.  Then compare that values along the range of list, that turns out be numerical values so that comparison becomes faster.

Explanation:

Every individual key is a big character  so to compare every keys, it is required to conduct a quite time consuming string reference procedure at every node. Alternatively we produce a complex (hash) value for key which mean that "to obtain a numerical value for every single string" that we are looking for.  Then compare that values along the range of list, that turns out be numerical values so that comparison becomes faster.