Give a state diagram for a DFA that recognize the following languages defined over = {0,1} 1. L = {wlevery 0 in w is immediately preceded and followed by 1}. 2. L = {ww has both 00 and 11 as substrings}. 3. L = {ww starts or ends with 01}