Coo:aicla:r 1.kua, follow.1)MA 2, (a) For each of the five strings below, say which state the DFA is in after reading the string, and say whether or not the DFA accepts the string. aaa bb bbb abab bbbbbbbbbbbbbbbaaa aabbbbababbaaabbaabbaba bbbb (b) Give two different strings of length 4 that each make the DFA go from state 0 to state 1