A spelling checker program reads an input file and prints all the words not found in some on-line dictionary. Suppose the dictionary contains 30,000 words and the input file is large, so that the algorithm can make only one pass through the input file. A simple strategy is to read the dictionary into a hash table and look for each input word as it is read. Assuming that an average word is 7 characters long and that it is possible to store words of L characters in L + 1 bytes (so space wastage is not a consideration), and assuming a quadratic probing hash table, how much space does the table require