Draw a DFA that recognizes the language of strings with at most 2 b's in them. Draw a DFA that recognizes the language of strings where every 3rd position is an a (so the 3rd letter is an a. the 6th letter is an a, ...) Draw a DFA that recognizes the union of the two languages from parts a and b, using the DFA union construction from class with your solutions to a and b. Draw an XFA that recognizes the union of the two languages from parts a and b, using the XFA union construction from class with your solutions to a and b