The following is a hash table implementation, with a comically small array size of 11 so as to illustrate the handling of collisions. In this case, we start building vectors to handle multiple entries.
