Consider the following state diagram of a finite automaton. D 0 0 0 B 1 For each of the following strings, give the exact sequence of states that the automaton undergoes when reading the string. Furthermore, indicate whether or not the string is accepted. Wi = W2 = 0111 W3 = 1000000100 W4 = 1010110 W5 = 11111111 . = Recall that e denotes the empty string