Introduction In this homework, you will create a C+ program that uses an AVL tree to read an input file and print the words in the text in alphabetical order Input and Output The input is a single text file containing a paragraph of unknown length. Example 1 of input Once upon a time, there was a little girl who lived in a village near the forest. The output of your program should be a text file containing all the words in the original file in alphabetical order. Only words must enter the tree (follow rules of HW3. Punctuation and numbers (including words including numbers or special characters) will not be included in the output. Furthermore, duplicates are not allowed in the tree. All words should be listed on a new line with the first character uppercase. At the end of the output, you will write the number of rotations required to keep the tree balanced. Example 1 of output Forest Girl Little Lived Near Once The There Time Upon Village Was Who