Read a count and then that many words. Print, in this order:
- the distinct words as a sorted set, e.g.
[apple, fig, pear]
- one line per word — the word, a space, how many times it appeared — in alphabetical order
- the alphabetically first and last word on one line
For 5 then pear apple pear fig apple:
[apple, fig, pear]
apple 2
fig 1
pear 2
apple pear
Use TreeMap and TreeSet: with the Hash versions the order would not be guaranteed and the output would be unpredictable.