Please help with code only after #your code here. Code will be tested with the great gatsby and war and peace txt$.$ I would also like to know how to fix the error $($TypeError: 'tuple' object is not callable$)$

Problem $2$: Using a Bloom Filter to Count Common Words.

In this problem, we will implement a Bloom filter to count how many elements of longe r$\_$words$\_$wp $($the words of length $5$ or more in War and Peace$)$

appear in the Great$-$Gatsby novel. To do so$,$ we will do the following:

Instantiate a Bloom filter with number of bits $n$ and number of hash functions $k.$

Insert all words from great$-$gatsby into the filter.

For each word from war and peace, check membership in the Bloom filter and count the number of yes answers.def $\_\_$init$\_\_($self$,$ nbits, nhash$)$: self.m $=$ nbits ## get k randdom hash functions# Function to insert a word in a Bloom filter. # your code here index $=$ hash$\_$fn$($word$)$# Check if a word belongs to the Bloom Filter # your code here index $=$ hash$\_$fn$($word$)$ return True

In $[11]$:

##o the exact countthis operation finishes very quickly.

all$\_$words$\_$gg $=$ set$($longer$\_$words$\_$gg$)$

exact$\_$common$\_$wc $=0$

for word in longer$\_$words$\_$wp: exact$\_$common$\_$wc $=$ exact$\_$common$\_$wc $+1$

print$($f$\text{'}$Exact common word count $=\{$exact$\_$common$\_$wc$\}\text{'})$

Exact common word count $=124595$

In $[16]$:bf $=$ BloomFilter$(100000,5)$

for word in longer$\_$words$\_$gg:for word in longer$\_$words$\_$gg:common$\_$word$\_$count $=0$

for word in longer$\_$words$\_$wp: common$\_$word$\_$count$=$ common$\_$word$\_$count $+1$

print$($f$\text{'}$Number of common words of length $>==5$ equals : $\{$common$\_$word$\_$count$\}$

assert $($ common$\_$word$\_$count $>=$ exact$\_$common$\_$wc$)$

print$(\text{'}$All$.$ Tests Passed: $10$ points'$)$

TypeError Traceback $($most recent call last$)$

I have copied the entire thing from the previous expert but it does not work. It shows NameError: name 'nbits' is not defined import random

def get$\_$random$\_$hash$\_$function$($seed $=$ None$)$: random.seed$($seed$)$def hash$\_$function$($word$)$:return hash$\_$function

class BloomFilter: self.bits $=[$False$]*$nbits # Initialize all bits to fals self.k $=$ nhash self.hash$\_$fun$\_$reps $=[$get$\_$random$\_$hash$\_$function$()$ for i in range$($self$.$k$)]$def insert$($self$,$ word$)$: for hash$\_$fn in self.hash$\_$fun$\_$reps: self.bits$[$index$]=$ Truedef member$($self$,$ word$)$: for hash$\_$fn in self.hash$\_$fun$\_$reps: if not self.bits$[$index$]$: return True

In $[24]$: #do the exact countthis operation finishes very quickly.

all$\_$words$\_$gg $=$ set$($longer$\_$words$\_$gg$)$

exact$\_$common$\_$wc $=0$

for word in longer$\_$words$\_$wp: exact$\_$common$\_$wc $=$ exact$\_$common$\_$wc $+1$

print$($f$\text{'}$Exact common word count $=\{$exact$\_$common$\_$wc$\}\text{'})$

Exact common word count $=124595$

In $[27]$: # Try to use the same using a bloom filter.for word in longer$\_$words$\_$gg:for word in longer$\_$words$\_$gg:common$\_$word$\_$count $=0$ if bf$.$member$($word$)$:print$($f$\text{'}$Number of common words of length $>=5$ equals : $\{$common$\_$word$\_$count$\}\text{'})$print$(\text{'}$All Tests Passed: $10$ points'$)$

NameError