Determine whether the following statement is true or false and justify your answer: (a) (2 points) is the subset of +. (b) (2 points) The minimum and maximum number of states that a DFA can have are zero and infinity, respectively. (c) (2 points) A standard Deterministic Finite Automata (DFA) has several start states but only one accept state. (d) (2 points) Suppose we have two DFAs M with 6 total states of which 2 are final and M2 with 5 total states of which 3 are final. Without any minimization, the union and intersection of these two DFAs have 28 and 10 final states, respectively. (e) (2 points) The following DFA accepts all strings with baa as a substring. start a b a 91 b,a a 92 93 b