Write a Lex program that converts a le to Pig Latin." Specially, assume the le is a sequence of words (groups of letters) separated by whitespace. Every time you encounter a word:
1. If the First letter is a consonant, move it to the end of the word and then add ay
2. 2. If the first letter is a vowel, just add ay to the end of the word.