1. Give state diagrams of DFAs recognizing the following languages. The alphabet is {0, 1}. (a) {w | w is any string except 11 and 111} (b) {w | every odd position of w is a 1}