DFA question. Please provide explanation for answer choices

(a) A DFA has exactly one start state True False (

(a) A DFA has exactly one start state True False (b) A DFA can have zero final states True False (c) The alphabet of a DFA must have cardinality at least 1. True False (d) “Total function” means that the sum of the functio s values is equal to the number of inputs True False (e) A DFA can have zero states. True False Show transcribed image text