COMPUTER SCIENCE MCQS: The minimum possible number of states of a deterministic finite automaton that accepts the regular langauge L [G17S2Q25]