Question $8.$ Consider the following algorithm.

Assume that the hash table used in this algorithm is implemented using CHAINED

HASHING and has size $n.($Note that far more than $n$ elements are inserted in the hash

table.$)$

What is the worst case running time of algorithm Count? Justify your solution and

show your work.

What is the expected running time of algorithm Count? Justify your solution and

show your work.