In Java,

1. Create a hash function for [strings | numbers | cards | people] which generates relatively unique values.

2. Hash [strings | numbers | cards | people] into a hash table of size [some number] using [separate chaining | open addressing with linear probing | open addressing with quadratic probing | open addressing with double hashing where h2(key) = 5 - (key % 5)] and the hash function you wrote above.

3. After hashing the above [strings | numbers | cards | people] remove three of them, making sure to visually indicate any special states.

4. Rehash your tables above to [a prime number over double the size].