Which regular expression best describes the language accepted by the non-deterministic automaton below?
(A) (a + b)* a(a + b)b
(B) (abb)*
(C) (a + b)* a(a + b)* b(a + b)*
(D) (a + b)*
Answer: (A)
DOUBT- I beleive the option A is wrong as dfa can accept string aaab but expression in A can not.
pls clarify? the given answer is wrong or not? if yes, then wha is the correct answer?