1. Select all true statements about bloom filters in the box below:

1. If data A was never inserted to bloom filter, it is guaranteed that find(A) returns false

2. If data A was inserted to bloom filter, it is guaranteed that find(A) returns true

3. To detect malicious URLs, bloom filter is in general better than hash table because of its low false positive rate.

4. For a fixed size bloom filter, using more hash functions can always help lower false positive rate.

5. Assume the bloom filter is using the same hash functions, increasing the size of the bloom filter can always help lower false positive rate.