1. Draw a DFA which accepts the following language over the alphabet of 0,13: the set of all strings which contain a block of four consecutive symbols exactly two of which are 0. Your DFA must handle all intput strings in [0,13 Here is a methodical way to do this: Figure out all the final states and label each with the shortest string it accepts, o work backwards from these states to the starting state, labelling each state you create with the shortest string accepted so far, o add the missing transitions. The labelling of the states with the shortest string it accepts is important in order to not get confused