A Java compiler uses a symbol table to keep track of the identifiers that a program uses. When the compiler encounters an identifier, it searches the symbol table to see whether that identifier has already been encountered. If the identifier is new, it is inserted into the table. Thus, the symbol table needs only insertion and retrieval operations Write an implementation of a symbol table that uses hashing. Use the hash function h(r) r mod tablesize and the algorithm that involves Homer's rule, as described in the section "Hash Functions," in the textbook to convert a variable into an integer z. Resolve collisions by using separate chaining. (See the code given on pages 748 to 750 of Chapter 13.) Since you add an item to the table only if it is not already present, does the time required for an insertion increase? In the main line of the program provide test code that inserts symbols such as "foo bar" and "baz Also ensure that your test code handles collisions and that it attempts to retrieve symbols which were not inserted. A Java compiler uses a symbol table to keep track of the identifiers that a program uses. When the compiler encounters an identifier, it searches the symbol table to see whether that identifier has already been encountered. If the identifier is new, it is inserted into the table. Thus, the symbol table needs only insertion and retrieval operations Write an implementation of a symbol table that uses hashing. Use the hash function h(r) r mod tablesize and the algorithm that involves Homer's rule, as described in the section "Hash Functions," in the textbook to convert a variable into an integer z. Resolve collisions by using separate chaining. (See the code given on pages 748 to 750 of Chapter 13.) Since you add an item to the table only if it is not already present, does the time required for an insertion increase? In the main line of the program provide test code that inserts symbols such as "foo bar" and "baz Also ensure that your test code handles collisions and that it attempts to retrieve symbols which were not inserted