Deterministic finite Automata.

1. Consider the languages L1 = ab*aa and L2 = a*bba*. a. Convert the regular expressions which define L, and L2 into nondeterministic finite automata. b. Define a nondeterministic finite automaton for the language L3 = L1 U L;. c. Convert your nondeterministic finite automaton from the prior problem into an equivalent determinstic finite automaton using the algorithm discussed in class (and the reading)