✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
A deterministic finite automata with alphabet {a,b} is given below
Which of the following DFA which accepts the same language as the language accepted by the above automata?