# Problem 67

# 2-choice hashing example

**Due**: March 22

**Points**: 1

Use the following two very simple hash functions:

\[h_1(x) = x \bmod 10\] \[h_2(x) = \left\lfloor\frac{x}{10}\right\rfloor\]

to insert the following sequence of keys:

\([97, 67, 60, 70, 13, 32, 87, 3, 58, 43]\)

into a hash table of size 10, using 2-choice hashing.