2) [2 points] Consider a bloom filter content of 10010 with two hash functions as follows: - h1(x)= Take odd-numbered bits from the right in the binary representation of x. Treat it as an integer i. Then, the result is i modulo 5. - h2(x)= same but take even-numbered bits. Now, solve for the following: 1. [1.5 points] Add the two elements 15 and 23 into the filter by showing all the steps. 2. [0.5 point ] Show whether element 18 has been seen before or not