1. Convert the above to an equivalent minimal DFA. Show the partitioning steps. Give the state diagram of the minimal DFA.
2. From above minimal DFA, describe an equivalent regular expression. Create a new start state (s) and a new final state (f). Show step by step eliminating one state at a time in deriving the regular expression.

91 Ob q3 92