Draw the state diagram of DFAs recognizing the following languages. 1. A={w length of w,w, is a multiple of 3} 2. B={11,111} 3. C={ww contains an even number of 0 's and contains exactly two 1's }