For each of the following languages a-d below, provide the state diagram of a DFA that recognizes the language. The alphabet for all these languages is { = {0, 1}. a) L1 = {e} b) L2 = 0 c) L3 = {0,1}* d) L4 = {we {*] w has even number of 1's} e) L5 = {w e {*] w does NOT contain the substring 011} Submission instructions 1. Mark your answers with a-e. 2. Submit your answer in the provided textbox. 3. You can copy/paste figures in the provided textbox. All figures must be included in the textbox. 4. You can use any tool to draw your figure or draw it by hand and take a picture of it. For each of the following languages a-d below, provide the state diagram of a DFA that recognizes the language. The alphabet for all these languages is { = {0, 1}. a) L1 = {e} b) L2 = 0 c) L3 = {0,1}* d) L4 = {we {*] w has even number of 1's} e) L5 = {w e {*] w does NOT contain the substring 011} Submission instructions 1. Mark your answers with a-e. 2. Submit your answer in the provided textbox. 3. You can copy/paste figures in the provided textbox. All figures must be included in the textbox. 4. You can use any tool to draw your figure or draw it by hand and take a picture of it