II$.$ Now create a program which uses a recordspace of size

greater than $25.$

$($it may help to use a prime of form $4n+3,$ such as $59)$

Hash $30$ values in the program using quadratic collision

processing. Indicate the number of collisions.

Now do the same using linear collision processing.

Indicate the number of collisions

Now do the same for a recordspace of size $16.($use the same values$)$

Use hash$($key$)$ key mod recordspace