Exercise 1

In this exercise you will scan through a dictionary (a list of words) and identify words with the following property: if you consider each word as an array of letters, it is possible to identify five positions in the array such that the letters at those five positions are the five vowels ('a', 'e', 'i', 'o', 'u'), and that the positions are in increasing order. Thus, the words has all five vowels and they occur in order. One example is "sacrilegious":

     s  a  c  r  i  l  e  g  i  o  u  s
     0  1  2  3  4  5  6  7  8  9  10 11

As you can see, the vowels occur in order at positions 1, 6, 8, 9, 10. We see that 'i' occurs in position 4, but that doesn't affect the property.

To solve this problem:

Scan through the words (which will be given to you in an array).
For each word, check if the property holds. To do this, you can look for an occurence of 'a', then an occurence of 'e' after that, and so on. To perform such checks, it'll be helpful to have the word as an array of letters (characters).
Note that a String can be converted to an array of characters quite easily, as this example shows:
```
     String str = "sacrilegious"
     char[] letters = str.toCharArray ();
  
```

More details:

Starting by downloading these three files: FindStrangeWords.java, WordTool.java, words
You will write all your code in FindStrangeWords.java. You'll see that code has been provided to read the dictionary for you. That's why you'll need to have WordTool.java in the same directory - this is what does the work of reading the dictionary.
The dictionary itself is the file words, the third download above.
Read through WordTool.java to learn how a list and an array are both used. You will also learn something about file I/O (reading from a file).
You should implement some (at least three) tests to test your code to add confidence that it works. Do this in the method myTests().

Submission:

Submit your file FindStrangeWords.java using these submission instructions. Do NOT email your program.
Don't forget to email the TA your encryption key.

What else is due:

Read through the supplemental material in the Introduction and do the exercises therein. Do NOT submit these, but have them ready to show the TA in the lab.