In a storage and retrieval technique known as hashing, the location of a data element in memory is determined by its value. Thus, for every element x, the address of x is f (x), where f is an...

In a storage and retrieval technique known as hashing, the location of a data element in memory is determined by its value. Thus, for every element x, the address of x is f (x), where f is an appropriately chosen function. This approach is used when the data space (set of potential values to be stored) is larger than the storage space (memory locations) but not all data need be stored at once. Inevitably, collisions occur, that is, f(x)= f(y) for x # y, and several strategies exist for resolving them. Describe a parallel algorithm for the hashing function, collision resolution strategy, and model of computation of your choice.