Please use bufferedReader instead of scanner. If the input is :

15 The class teacher asks students to name an animal that begins with an "E". One boy says, "Elephant. Then the teacher asks for an animal that begins with a "T". The same boy says, "Two elephants." The teacher sends the boy out of the class for bad behavior. After that she asks for an animal beginning with "M". The boy shouts from the other side of the wall: "Maybe an elephant!" Then, the expected output is this:

n = 15 highest frequency: 7 / 15 = 46.67% High vowel frequency parts: 33 thru 47: o name an anima 174 thru 188: he same boy say 175 thru 189: e same boy says 383 thru 397: Maybe an elepha 384 thru 398: aybe an elephan

2. Program 2 - Vowels Count In this question you are asked to implement a program that finds subsequence that contains the highest frequency of vowels given a short paragraph. For simplicity, we will be interested in subsequences of a particular length, n that will be provided as part of the input . Write a program that takes the name of a plain text file that contains a short paragraph and an integer N. You will then find the indices of the subsequence of paragraph of length n that contain the highest frequency of vowels in it. For example, if the paragraph is 1 The class teacher asks students to name an > 2 | animal that begins with an 'E' 3 One boy says , ''Elephant 4 Then the teacher asks for an animal that 5 begins with a '*T ' . 6 The same boy says, ''Two elephants.'' 7 The teacher sends the boy out of the class 8 for bad behavior 9 |After that she asks for an animal beginning