Consider the regular language L over {a,b} that consist of all words in sigma star that have an even number of a's. create a minimal finite automata M that accepts L and show that M is minimal. Using the minimal FA algorithmically derive a regular expression for L by creating a GNFA and elimating states.