(Answered): 1. Draw a state diagram for nondeterministic finite automata that accepts the following languages 1 ...

1. Draw a state diagram for nondeterministic finite automata that accepts the following languages 1.1. 1.2. (ba ub) u (bb Ua) ((ab)*(ba)") uaa" 2. Give the regular expression for the language accepted by the following finite automaton: a 1 2 a a b a, b 6 2,6 3. Write the regular expression for the following sets 3.1. All strings over {a,b} that are odd in length 3.2. All strings over {a,b} that end with bb