Q. 84 Solve the problems and choose the correct answers.
Consider the following Finite State Automation
The language accepted by this automaton is given by the regular expression
(A) b * ab * ab * ab *
(B) (a + b)*
(C) b * a(a + b)*
(D) b * ab * ab *
Answer: (C)
Explanation:
