Problem 2 (20): Give state diagrams of DFAs recognizing the following languages. The alphabet is 2={0,1} (a) L = {w | every odd position of w is a 1} (b) L2 = {w | w contains an odd number of O's, or exactly two l's}