Consider the following alternative implementation of the dictionary operations by means of unordered linked lists. Allow multiple nodes to exist with the same key value, and implement insert() simply by adding a new node to the front of the list.

(a) Give algorithms (using pseudo-code) for the insert(), find(), and remove() operations and analyze their complexity. (Be sure to say what n is.)

(b) Under what circumstances (as measured by the relative frequencies of the three kinds of operations) might this implementation make sense?