Write a java program that contains a method called wordLengths that accepts a Scanner representing an input file as its argument. Your method should read from the given file, count the number of letters in each token in the file, and output a result diagram of how many words contain each number of letters. Use tabs before the asterisks so that they'll line up. If there are no words of a given length, omit that line from the output.
For example, if the file contains the following text:
Before sorting:
13 23 480 -18 75
hello how are you feeling today
After sorting:
-18 13 23 75 480
are feeling hello how today you
your method should produce the following output to the console:
2: 6 ******
3: 10 **********
5: 5 *****
6: 1 *
7: 2 **
8: 2 **
You may assume that no token in the file is more than 80 characters in length.