0
Implement Bloom filter insertion
A Bloom filter is a probabilistic data structure that is used to determine whether an element is in a set in a fixed number of bits. It consists of:
a bit array \$B\$ of fixed size \$m\$, initialized as all \$0\$s, and
\$k\$ different hash functions \$h_1,\ldots,...