Show me the steps to solve Write a JAVA PROGRAM to count the occurrences of each word $($case in$-$sensitive$)$ in a large text file $($mobydick$.$txt$).$

Use a map data structure Map map

Word $->$ wordCount$($# of occurrences$)$ map

Read a word from the file

Check to see if the word is already in the map $($HINT: containsKey $($word$))$

If Yes, wordCount$++($HINT: use get$($word$)$ and put$)$

Else put $($word$,1)$

$($TEST$)$ the map size should be $30667$

Allow the user to type a word and report how many times that word appeared in the book

Print all words that appeared in the book at least $1000$ times

If you are using a TreeMap, here is a sample output

a all and as at but by for from he his i in is it not of that the this to was with