Start with code:

#include

const int TABLE$\_$SIZE $=17$;

class HashMap $\{$

private:

HashEntry $*$table;

public:

HashMap$()\{$

table $=$ new HashEntry$*[$TABLE$\_$SIZE$]$;

for $($int i $=0$; i $<$ TABLE$\_$SIZE; i$++)$

table$[$i$]==$ NULL;

$\}$

int get$($int key$)\{$

int hash $=($key $\%$ TABLE$\_$SIZE$)$;

while $($table$[$hash$]!=$ NULL && table$[$hash$]->$getKey$()!=$ key$)$

hash $=($hash $+1)\%$ TABLE$\_$SIZE;

if $($table$[$hash$]==$ NULL$)$

return $-1$;

else

return table$[$hash$]->$getValue$()$;

$\}$

void insert$($int value$)\{$

int hash $=($value $\%$ TABLE$\_$SIZE$)$;

if$($get$($value$)==-1)\{$

table.push$\_$back$($value$)$;

$\}$

else if$($get$($value$)!=-1)\{$

table$[$hash$]->$getValue$()->$value;

$\}$

$\}$

~HashMap$()\{$

for $($int i $=0$; i $<$ TABLE$\_$SIZE; i$++)$

if $($table$[$i$]!=$ NULL$)$

delete table$[$i$]$;

delete$[]$ table;

$\}$

$\}$;

int main$($int argc, const char $*$ argv$[])$

$\{$

HashMap Kirsten;

Kirsten.insert$(12)$;

$\}$

Then write the main and insert function to insert the sequence of integers $\{138,99,16,134,42,0,6,9,4,53,47,66)$ using a table of size $17.$ Then implement rehashing algorithm of choice and run the same sequence of input using a table of size $7.$