Cleaning

In ignoreWords.txt you are given the 50 most commonly occuring words in the English language (separated by whitespaces). Write a program (you will need a new cpp file here) that creates a new text file excluding all occurrences of any of these words from a given input text file. Test your program on the test file you created in part 1 (100 words) and call it something like cleanedTextTest.txt.

If your algorithm appears to be working correctly, run it on the full Hunger Games file (use the number of words you found in part 1A and call it something like cleanedText.txt.

(Since we have not introduced techniques for creating variable length arrays, you should manually declare your arrays to a fixed length. Your array length(s) should be set to a specified lengthwithinthe cpp file, as we cannot change the length of standard arrays during program execution time.)