1. Consider the language L of all strings consisting of O's followed by a (possibly empty) string of 1's followed by a (possibly empty) string of O's. a. [7 marks] Draw a deterministic finite automaton that accept this language b. [1 mark] Formally write down the alphabet of the language c. [2 marks] Give two strings with the correct alphabet and a minimum length of 7 symbols: one that is accepted and one that is not accepted by this automaton. d. (5 marks] According to the DFA definition, list the 5-tuple for this automaton. b. (5 marks] Give a Regular Expression (RE) for L. I (20 marks)