Draw the state diagram of DFAs recognizing the following languages. Alphabet = {0,1}. a. A = {ww starts with 0 and has odd length, or starts with 1 and has even length} b. B = {ww is any string except 11 and 111} c. C = {{0}