Problem 1. ( Array-based Symbol Table ) Develop a symbol-table implementation ArrayST that uses an (unordered) array as the underlying data structure...

Problem 1. (Array-based Symbol Table) Develop a symbol-table implementation ArrayST that uses an (unordered) array as the underlying data structure to implement the basic symbol-table API (p. 363). 

$ java ArrayST Pluto

Mercury Venus Earth Mars Jupiter Saturn Uranus Neptune Pluto

<ctrl -d >

Mercury 1

Venus 2

Earth 3

Mars 4

Jupiter 5

Saturn 6 Uranus 7

Neptune 8

Problem 2. (Frequency Counter) Modify FrequencyCounter from the text to use ArrayST from above and also to print all of the values having the highest frequency of occurrence, instead of just one. 

$ java FrequencyCounter 1

to be or not to be that is the question

<ctrl -d >

to be 2

distinct = 8

words = 10