Consider the deterministic finite automaton M with states {Q, R, S, T}, input alphabet {0, 1}, start state Q, accepting states Q and S, and with the following transition: 3.1) How many states are there in an equivalent minimal finite state automaton? 3.2) How many accepting states are there in an equivalent minimal finite state automaton? 3.3) Which of the following regular expressions describes the language recognized by this automaton? (a) (0 union 1)* (b) 0*1* (c) ((0 union 1) (0 union 1)) (d) 1*0* (e) (01)* (f) (10)* (g) None of these. Consider the deterministic finite automaton M with states {Q, R, S, T}, input alphabet {0, 1}, start state Q, accepting states Q and S, and with the following transition: 3.1) How many states are there in an equivalent minimal finite state automaton? 3.2) How many accepting states are there in an equivalent minimal finite state automaton? 3.3) Which of the following regular expressions describes the language recognized by this automaton? (a) (0 union 1)* (b) 0*1* (c) ((0 union 1) (0 union 1)) (d) 1*0* (e) (01)* (f) (10)* (g) None of these