1. Write an algorithm for a deletion function for hash tables that replaces the record with a special value indicating a tombstone. Modify the functions hash Insert and hash Search to work correctly with tombstones.
2. Consider the following permutation for the numbers 1 to 6:
2, 4, 6, 1, 3, 5
Analyze what will happen if this permutation is used by an implementation of pseudo-random probing on a hash table of size seven. Will this permutation solve the problem of primary clustering? What does this say about selecting a permutation for use when implementing pseudo-random probing?