Regular grammar

Q.1

Q.2

Define a regular grammar which defines a language whose Define a regular grantmar which defines a language whose sentences are the tof al srings of leiiers which con cach of the five vowels exactly once and in order. Use only lower case letters. For example, your regular grammar must be capable of generating the strings aeiou, ateitou, and zeioupg but not aeou, aaeiou, and aeitgaou. You may use only the , , and metacharacters in your regular grammar