There is no input to the program other than the data file data.txt and the only output generated is the output file words.txt. All punctuation should be removed except for an apostrophe found within the word. You may assume that there will never be more than 100,000 unique words in your input data file. As always, your program must include proper documentation, indentation, and naming conventions. Hints Comparison of strings must be done on strings of the exact same case to ensure accurate comparison.
Words connected by punctuation are separate words.
The book has an example and discussion of case conversion and removing characters from a string in its example in section 10.3 of your text. Code comparing the merge sort and the selection sort was used in CS 114 and can be found here . Our program takes out punctuation and numbers. The numbers are being excluded in the sample output. Our program outputs all apostrophes, therefore a word like 'twas would be different from twas or a word like 'go' different from go or 'go or go' .