$In$ the Hash Sets lab $we$ saw how a hash set could $be$ written using array$-$based lists for slots. Similar $to$ the $BST$ comparisons $we$ did $in$ Assignment $8,we$ would like $tobe$ able $to$ compare the efficiencies $of$ different types $of$ hash sets.

Use the Word.$py$ module $to$ store Word objects $inaHas{h}_{S}et.$

Use the file miserables.$txt(Les$ Miserables $by$ Victor Hugo$),as$ your test text. The file $is$ very large $so$ executing your tests may take a few minutes. $Do$ not resubmit this file $as$ part $of$ your assignment submission!

Insert every word $in$ the test file into $aHas{h}_{S}et.$ A word $is$ defined $as$ a string that has $no$ space characters and consists $of$ only letters. $(For$ simplicity, ignore any words that contain punctuation $-$ you don't have $to$ strip off the punctuation, you can just ignore $it.)$ Convert the word $to$ lower case before inserting $it$ into the $Has{h}_{S}et.$

Determine how many comparisons were needed $to$ insert all $of$ the words into the $Has{h}_{S}et.(Given$ that data $is$ stored only once $inaHas{h}_{S}et,$ you are really counting the number $of$ comparisons needed $to$ insert a Word once, then the number $of$ comparisons $to$ reject the word $as$ already being $in$ the $Has{h}_{S}et.We$ don't care about the difference between the two types $of$ comparison.$)$

Determine the individual Word that had the most comparisons attached $toit.$

When retrieving the comparisons from the hash set, $dosoby$ walking through every element $in$ the hash set, not $by$ looking for the words again $-$ that will change the number $of$ comparisons.

Create your hash set with a load factor $of20$ and $an$ initial size $of20.$

Write the following function $to$ process the test file and insert all its words into a hash set:

def $inser{t}_w$ords$(fv,has{h}_{s}et)$:

$"""$

$-------------------------------------------------------$

Retrieves every Word $infil{e}_v$ariable and inserts into

$aHas{h}_{S}et.$ Each Word object $inhas{h}_{s}et$ contains the number

$of$ comparisons required $to$ insert that Word object from

$fil{e}_v$ariable into $has{h}_{s}et.$

Use: $inser{t}_w$ords$(fil{e}_v$ariable, $has{h}_{s}et)$

$-------------------------------------------------------$

Parameters:

$fv-$ the already open file containing data $to$ evaluate $(file)$

$has{h}_{s}et-$ the $Has{h}_{S}etto$ insert the words into $(Has{h}_{S}et)$

Returns:

None

$-------------------------------------------------------$

$"""$

and the following function $to$ extract the comparison counts and word with the most comparisons from the hash set:

def $compariso{n}_t$otal$(has{h}_{s}et)$:

$"""$

$-------------------------------------------------------$

Sums the comparison values $of$ all Word objects $inhas{h}_{s}et.$

Use: total, $ma{x}_w$ord $=compariso{n}_t$otal$(has{h}_{s}et)$

$-------------------------------------------------------$

Parameters:

$has{h}_{s}et-$ a hash set $of$ Word objects $(Has{h}_{S}et)$

Returns:

total $-$ the total $of$ all comparison fields $in$ the $Has{h}_{S}et$

Word objects $(int)$

$ma{x}_w$ord $-$ the word having the most comparisons $(Word)$

$-------------------------------------------------------$

$"""$

Put these functions $in$ the PyDev module functions.$py$ and test them from $.$ The output from this program must look like:

Using array$-$based list $Has{h}_{S}et$

Total Comparisons: $x,xxx,xxx$

Word with maximum comparisons $\text{'}www\text{'}$: $xx,xxx$