4. Design a DFA that accepts all strings over (0,1 that has the property that every segment of five consecutive symbols contains at least two O's. (For example, if the string has length ten, there are altogether six segments of five consecutive symbols Also note that, in a formal logical sense, this property is satisfied when the string is of length at most 4. To invalidate the condition there has to exist five consecutive symbols that contains fewer than two 0's. This is true even if the string is 1111 which has the property that no matter how one might extend it there is no hope to have two O's in the first 5 symbols. But that is still not a violation of the condition, for simply there is no counter-example for the string 1111 of length four.) Hint: What would you like to keep track of? How many 0's are there among the last 5 symbols, and the last 4 symbols, ....)