Suppose I have a DFA

with

states that recognizes language

and a DFA

with

states that recognizes language

$.$ What can be said about the language

$?$

Group of answer choices

There exists a DFA that recognizes

and it must be that this DFA has at least

states.

There exists a DFA

that recognizes

and the maximum number of states

can have is

$.$

There exists a DFA that recognizes

with

states.

Both $($a$)$ and $($c$).$

Both $($b$)$ and $($c$).$