What is the number of states in the minimal DFA with input symbols {0,1,2} where 2nd last symbol is 1?

Question

four options:-

A. 8

B. 9

C. 6

D. None

can somebody please explain the answer diagrammatically..

Answer 1

B.9

Whenever the question says the nth symbol from the right side is fixed and the input language has m symbols the answer for minimal dfa is m^n . So 3^2 = 9