1. (5 points) Define a regular grammar which defines a language whose sentences are the set of all strings of letters which contain each of the five vowels exactly once and in order. Use only lower case letters in your grammar For example, your regular grammar must be capable of generating the strings aeiou, ateitou, and zaeztiouzpq, but not aeou, aaeiou, and aeitgaou. You may use only the ., *, +, [ ], and ^ metacharacters in your regular grammar. Solution