Consider a simple Bloom Filter with just two hash functions h1 and h2 and three keys k1, k2, and k3. The output of the hash functions is as follows: h1(k1) = 1, h2(k1) = 1 h1(k2) = 1, h2(k2) = 0 h1(k3) = 0, h2(k3) = 0 Which three conclusions can be respectively reached about the entities represented by k1, k2, and k3 (one each per k1, k2, and k3)

Multiple answers:You can select more than one option

A

k1 is definitely in the data set

B

k1 is definitely not in the data set

C

k1 may be in the data set

D

k2 is definitely in the data set

E

k2 is definitely not in the data set

F

k2 may be in the data set

G

k3 is definitely in the data set

H

k3 is definitely not in the data set

I

k3 may be in the data set