a. For the given transition table, solve the following: States qo q1 9: q3 q+ a 91 91 - - 91 b 94 94 94 i. The DFA using the above transition table? C 93 93 93 93 93 d 92 92 92 | | 92 92 [4 marks] ii. Complete the definition for the automaton in the above transition table. [5 marks] iii. Write down the language L to express the type of strings recognized by the automata in a.i. [6 marks]