9. Which states should be marked as accepting states so that the automaton given by the transition table below accepts all strings with odd numbers of a's and odd numbers of b's: q a b A B C B A D C D A D C 10. Given is the transition function d for the automaton in question 9, what is S*(1, ab)