Write a program that reads the contents of a text File. The program should create a map in which the key-value pairs are described as follows:

? Key-The keys are the individual words found in the file. ? Values-Each value is a set that contains the line numbers in the file where the word (the key) is found. For example, suppose the word "robot" is found in lines 7, 18, 94, and 138. The map would contain an element in which the key was the string "robot", and the value was a set containing the numbers 7, 18, 94, and 138.

Once the map is built, the program should create another text File, known as a word index, listing the contents of the map. The word index file should contain an alphabetical listing of the words that are stored as keys in the map, along with the line numbers where the words appears in the original file. Figure 17-9 shows an example of an original text File (Kennedy.txt) and its index file (index.txt).

Kennedy.txt-Notepad File Edit Format View Help kle observe today not a victory of party but a celebration of freedom symbolizing an end as well as a beginning signifying renewal as well as change X Ln 12, Col index.bt-Notepad File Edit Format View Help Ke: 1 a: 124 an: 3 as: 4 5 6 beginning: 4 but: 2 celebration: 2 change: 6 end: 3 freedom: 3 not: 1 observe: 1 of: 23 party: 2 renewal: 5 signifying: 5 symbolizing: 3 today: 1 victory: 1 well: 45 0 X Ln 21, Col1