Consider the languages L 1 = ab aa and L 2 = a bba .

a. Convert the regular expressions which define L 1 and L 2 into nondeterministic finite automata.

b. Define a nondeterministic finite automaton for the language L 3 = L 1 L 2 .

c. Convert your non-deterministic finite automaton from the prior problem into an equivalent deterministic finite automaton

Note: If you can do part b and c that will be great, otherwise part c is badly needed by me.