Give the transition diagram of a DFA recognizing the language of all binary strings where there are at least four 1's occuring somewhere before the third 0 (provided it exists). (So the only strings to reject are those that have at least three 0's and there are fewer than four 1's occuring before the third 0.)