LaboratorylZA Part 4: Counting and Displaying Unique Words in a Text 4' You are given the le Gettysburgtxt, which contains Lincoln's entire Gettysburg address. ' Here is your next task to perform: - Write a program which counts all the unique words that exist in the address. ' Call the program: YourNomc-LablMcpp - This should be case insensitive leg. \"The\" is the same word as "the\"? - You should not list nor count any non-words leg. "- -" is not a word}. - Your count and list should not differentiate between words because of punctuation that may be attached to the end ofthem {e.g. \"war\The set() class - What makes the setl} class so useful is that it only allows unique elements to exist in the set - all duplicates are removed. - To use the set class we need to include the following libraries: #include #include citeratora - You may declare a set 5, of type string, with the declaration: set s; - You may insert the string variable, word, with the command: s.insert(word); - Finally, you may display all the words in a set with: set::iterator iter; for {iter = s.begin(]; iter !=s.enc|I; iter++} cout