# your code here # Generating random coefficients a and b for hash function ax $+$ b

a $=$ random.randint$(1,100)$

b $=$ random.randint$(1,100)$

return lambda x$,$ m: $($a $*$ hash$($x$)+$ b$)\%$ m

# Function to hash a string

def hash$\_$string$($self$,$ word$)$:

return hash$\_$string$($word$)\%$ self.mthy

# function: increment

# given a word, increment its count in the countmin sketch

def increment$($self$,$ word$)$:

# your code here hash$\_$val $=$ self.hash$\_$fun$\_$rep$($word$,$ self.m$)$

self.counters$[$hash$\_$val$]+=1$

# function: approximateCount

# Given a word, get its approximate count

def approximateCount$($self$,$ word$)$:

# your code here hash$\_$val $=$ self.hash$\_$fun$\_$rep$($word$,$ self.m$)$

return self.counters$[$hash$\_$val$]$

# Example usage:

# Initialize CountMinSketch

num$\_$counters $=100$

cms $=$ CountMinSketch$($num$\_$counters$)$

# Increment counts for words

words $=["$apple$",$ "banana", "apple", "orange", "apple", "banana"$]$

for word in words:

cms$.$increment$($word$)$

# Get approximate counts

print$("$Approximate counts:"$)$

for word in words:

print$($f$"\{$word$\}$: $\{$cms$.$approximatecount$($word$)\}")$ is this right