1. For every language L below, design a DFA M=Q,,,q0,F> to accept the language (L(M)=L). Present the DFA as the state transition diagram and for every qQ, state the meaning of the state. You may design a DFA directly or design an NFA and convert it. State the (semantics) meaning of every state in the directly designed DFA or the NFA and its the converted DFA. [3+5+7=15] (a) L1={ww and starts with 01 and ends with 10}, where ={0,1} (b) L2={ww and starts with a 1 and every 0 is immediately preceded by at least two 1s}, where ={0,1} (c) L3={ww and in w every 2 is immediately followed by exactly two 0s and every 1 is immediately followed by either 0 or else by 20}, where ={0,1,2}