For the following problem sets, you will perform hashing using different collision mechanisms.

The hashtable has a size of $13$ and will use the following hashing algorithm that returns an

integer:

def get$\_$hashed$\_$value$($key$)->$ int:

return key $*2+3$

For each of the problem sets, you will keep track of the number of collisions and show your

work for each step after inserting the following values:

$`5,4,25,8,10,34,18,51,17,21`$

$1.$ Linear Probing $-$ For this example, use "simple" linear probing in order to insert the

values into the hash table.

$2.$ Re$-$hashing $-$ For this question, use the re$-$hashing approach to handle collisions. The

re$-$hash algorithm is simply $`$get$\_$hashed$\_$value$($current$\_$index$)`,$ where current$\_$index is

the index of the current collision.