Let S and T be two sets and let BA and Bt be two bloom filters of same size that are constructed using the same set of hash functions h[... hk. Let Bst be the bloom filter for SAT using the same hash functions h, --- hk. Let B be a bit array such that B[i] is AND of the ith bits of Bs and Bt. Is B the same as the Bst. Prove your answer. Suppose we use B to answer queries bout the membership in SAT. What kind of error might occur? False Positives (and element is not in SAT, and is answered yes)? False Negatives (An element is in ST, and is answered no)? Explain your answer. Let S and T be two sets and let BA and Bt be two bloom filters of same size that are constructed using the same set of hash functions h[... hk. Let Bst be the bloom filter for SAT using the same hash functions h, --- hk. Let B be a bit array such that B[i] is AND of the ith bits of Bs and Bt. Is B the same as the Bst. Prove your answer. Suppose we use B to answer queries bout the membership in SAT. What kind of error might occur? False Positives (and element is not in SAT, and is answered yes)? False Negatives (An element is in ST, and is answered no)? Explain your