## EXPERT ANSWER

The objective of this question is to test the student’s understanding of Bloom filters and their applications in computer science. Specifically, the question requires the student to derive three different expressions related to Bloom filters: the expected number of zero bits in the hash table, the probability of false positives, and an approximation of the false positive probability.