Write a symbol table package consisting of two routines: enter(symbol, value) and lookup(symbol, value). The former enters new symbols in the table and the latter looks them up. Use some form of hash coding.

Repeat the previous problem, only this time instead of using a hash table, after the last symbol is entered, sort the table and use a binary-lookup algorithm to find symbols.