Our alphabet is {a, b}. Construct a DFA that recognizes the set of strings such that each block of 4 consecutive symbols contains at least two as.

example of acceptable strings are; aaaa; aaab;abab; baba; bbaa; babab (however bababb is not acceptable);

example of Strings that are not acceptable include- bbab(a+b)*; babb(a+b)*; bbb(a+b)*;