For input, use the w1000.txt file that has the first 1000 lines of the Stanford web. To test, your Project part 2, use the regular expression Stanford i.e., the eight characters above, including a capital "S". This RE should find all occurrences where Stanford appears capitalized. Next, try your project on the regular expression [A-Z][a-z]*{s}of{s}[A-Z][a-z]*{s} that is, search for substrings where two capitalized words are connected by "of". Notice that {s} is Nathan's code for a ``space'' which can be any of blank, newline, or tab. This expression should match strings like "School of Business". An earlier version did not have the space at the end, and therefore would signal acceptance as soon as it got to the ``B''. Remember, in each case you should search for the pattern anywhere, not just at the beginning of the file. That is, precede the patterns by .* if you have not devised an automatic way of treating RE's as if they could start at any point.