Choose the correct statement for the following daigram.
(a) For the language accepted by A which is also a minimal DFA
(b) A accepts all strings over {0,1} of length at least 2
(c) All of the mentioned
(d) None of the mentioned
I got this question during an internship interview.
This intriguing question originated from Minimization of DFA in division Finite Automata and Regular Expression of Compiler