! Exercise 2.2.5: Give DFA's accepting the following languages over the alpha- bet {0,1}: a) The set of all strings such that any five consecutive symbols contains at least two O's. 54 CHAPTER 2. FINITE AUTOMATA b) The set of all strings whose tenth symbol from the right end is a 1. c) The set of strings that either begin or end (or both) with 01. d) The set of strings such that the number of O's is divisible by five, and the number of 1's is divisible by 3