Description of DFA: A DFA over the alphabet (0, 1, 2} which rejects all strings starting with al or 2 and a string starting with a 0 takes the DFA from the start state which is a final state to a...

I need correct figure and answer only upvote

Otherwise downvotes

Extracted text: Description of DFA: A DFA over the alphabet (0, 1, 2} which rejects all strings starting with al or 2 and a string starting with a 0 takes the DFA from the start state which is a final state to a non-accepting state. Consider the DFA described above. Let S denote all the seven bit strings where the first, fourth and seventh bits are l's. The number of strings in S accepted by M is