The code has following $4$ functions:

div$\_$hash$($int key, int $M)$: divides key $k$ with $M$ size of hash table and use remainder of it$,$ returns hash value

$h(K)=$kmodM

$k=12345$

$M=95$

$h(12345)=12345$mod$95$

$,=90$

mid$\_$sqr$\_$hash$($int key, int M$)$: it has $2$ steps:

Square the key $k,$ which is $k^{**}k.$

Take digits from square of key by dividing it by $M$ and further mode by $M,$ return hash value

$h(K)=h(kxk)$

$k=60$

$M=100$

$kxk=6060$

$=3600$

$h(60)=\frac{60}{\frac{?}{?}}100\%100$

The hash value obtained is $60$

double$\_$hash $($int key, int M$)$:

$h1(key)=ke\frac{y}{\%}M$

$h2(key)=1+($ key $\%13)$

example : key $=12345$

$M=1000$

$h1(12345)=345$

$h2(12345)=1+(12345\%13)=1+8=9$

$i=1$ rehash $=345+1^{**}9=354,354$ is not palindrome

$i=2$ rehash $=345+18=363$ is palindrome stop

if i$>5$ and rehash value is not palindrome then make reverse of rehash as hash value.

return hash value

mult$\_$hash$($int key, int A$)$:

Perform following steps:

Choose a value A from AMCt$+$