Insert and query on a Bloom filter of size m $=10$ and number of hash functions k$=3.$ Let H$($x$)$ denote the result of the three hash functions which will write as a set of $$three values $\{$h $1($x$),$ h $2($x$),$ h $3($x$)\}$Has functions used: A$=$ x mod $10,$ B$=$ x mod $7,$ C$=($sum of digits$)$ mod $9.$