Solve this problem for C++

I need the full code

32.1 Project 1: A Simple Text Processing Program In the text mining, the loaded text needs to be (pre-) processed before it can be used for information extraction, In this project, you will be asked to implement a simple text processing program. Your program should provide the following functionality - Load a text file based on the user input filename [You can safely assume that the number of lines in the file will not be more than 10 ] - Count the number of words in the text [You can safely assume that the number of words will not be more than 100) - Find the longest word that appears the last alphabetically - Replace all non-alphabetical characters with whitespaces - Group the words with the same length together and sort them alphabetically before outputting the sorted words to a text file, named 'sorted.txt' - Find all the palindrome words (i.e, words that read the same from both forward and backward directions. Examples include "eye", "noon", "mom", etc.). Print out the found palindrome words onto extraction. In this project, you will be asked to implement a simple text processing program. Your program should provide the following functionality - Load a text file based on the user input filename [You can safely assume that the number of lines in the file will not be more than 10] - Count the number of words in the text [You can safely assume that the number of words will not be more than 100] - Find the longest word that appears the last alphabetically - Replace all non-alphabetical characters with whitespaces - Group the words with the same length together and sort them alphabetically before outputting the sorted words to a text file, named "sorted txt" - Find all the palindrome words (i.e., words that read the same from both forward and backward directions. Examples include "eye", "noon", "mom", etc.). Print out the found palindrome words onto screen. When your program is run, it will first ask for an input of a filename. If the user enters a filename whose corresponding file does not exist, the program will output and exit. Otherwise, the program will show the following menu repeatedly until user enters a 0 and exit. Otherwise, the program will show the following menu repeatedly until user enters a 0 Please make your choice: 0 - Exit 1 - Word count 2 - Find the longest word that appears the last alphabetically 3 - Replace all none alphabetical characters with whitespaces and output the new text on screen 4 - Output al1 words in order of their lengths and alphabetically 5 - Output all palindrome words - If the user enters a value other than 0,1,2,3,4, or 5 the program will output Please only enter 0,1,2,3,4 or 5! then ask the user to enter an integer until the user enter a valid integer. - If the user enters 0 , the program will exit. - If the user enters 1, the program will count the number of words in the text and output The number of words in the text is number of words in the text and output The number of words in the text is - If the user enters 3, the program will replace all non-alphabetical characters with whitespaces and output the updated text. - If the user enters 4, the program will group the words based on their lengths and sort the words in each group (with the same length) in an ascending order alphabetically. The program will then output the sorted words (one word each line) to the file "sorted.txt". For example, given a text file, named "text1.txt" (also provided as a test file) with the following content Dreaming of one day being as fearless as a mango. As friendly as a tomato. Merciless to chin \& shirtfront. If the user enters 1, it will output to the screen The number of words in the text is 19 If the user enters 4 , it will output to the "sorted.txt" with the following content If the user enters 5 , the program prints out nothing as there are no palindrome words. [Note that a word with a single character is NOT a palindrome word!] Note that any hard code of the output will result in a zero for this project. \begin{tabular}{l|l} LAB & 32.1.1: Project 1: A Simple Text Processing \\ ACriviry & Program \end{tabular} Submission Instructions Downloadable files , and Compile command We will use thi Upload your files below by dragging and dropping into Coding trall of your work History of your effort will appear