Consider a Bloom filter implemented in a proactive password checker. Four independent hash functions are used. There are 5 million words in the dictionary. In order to have a 0.008 probability of rejecting a password not in the dictionary, a) What is the size of the hash table in bits? (Please use the formula to calculate it instead of reading from the graph.) b) What is the size of the dictionary in bytes? (Assuming that 8 bytes are used to store each word) c) What is the factor of compression achieved?