Write a program that reads a word and prints
the number of syllables in the word. For
this exercise, assume that the syllables are
determined as follows: Each sequence of
adjacent vowels a, e, i, o, u, y, except for the
last e in a word, is a syllable. However, if that
algorithm yields count of 0, change it to 1. For
example:
harry 2 syllables
hairy 2 syllables
hare 1 syllable
the 1 syllable