3. A finite automaton has the initial state q0, and the other two states q1 and q2. The transition function is (q₀, 1) = q₁ , (q₁, 1) = q₀ , (q₂, 0) = q₂ , (q₂, 1) = q₂ , (q₀, 0) = q₂. q₀ is the initial state, and q₂ is the final state. Draw a transition diagram for this finite automaton. Create a regular expression to denote the set of strings accepted by this finite automaton. Also describe this set of strings in set notation. (15 pts)