5. Which automata define the same language? (b3 (c) Note: (b) and (d) use transitions on strings. You may assume that there are nonacecpting intermediate states, not shown, that are in the middle of these transitions, or just accept the extension to the conventional finite automaton that allows strings on transitions and, like the conventional FA aceepts strings that are the concatenation of labels along any path frem the start state to an accepting state. a) a and c b) a and d c) bratc d) c and d 6. The following nondeterministic finite automaton: accepts which of the following strings? a) 00110100 b) 1100101 c) 0010010 d) 1011101 7. Here is a noodeterministic finite automatos: Sonse input strings lead to more than one state. Find, in the list below, a string that leads from the start state A to three different states (possibly inclading A ). a) 00100 b) 1010 c) 0000 d) 1110