1. (5 points - 1 point each) State True or False for each of the following questions. If the answer is False, provide a brief justification. (Let E, F, and G be three arbitrary regular expressions.) a) There are k states in a DFA and l symbols in its alphabet. This implies that there are no more than kxl transitions in the DFA. b) A DFA has been constructed from an NFA with n states using the lazy creation procedure. The maximum number of states the DFA could have is 2n. c) E*+F* = (E* +F*)* d) (F* + E F*)* = (F + EF)* e) E*(F+G) = (F+G) E*