Let L ⊆ {0,1}* be an arbitrary regular language accepted by a minimal DFA with k states. Which one of the following languages must necessarily be accepted by a minimal DFA with k states? 

Consider the following deterministic finite automaton (DFA).

The number of strings of length 8 accepted by  the above automaton is __________

Which one of the following regular expressions represents the set of all binary strings with an odd number of 1’s?

Consider the following statements.

I. If L₁ $$ \cup $$ L₂ is regular, then both L₁ and L₂ must be regular.

II. The class of regular languages is closed under infinite union.

Which of the above statements is/are TRUE?