Q1. L1 is the language of all strings expressed in base 3 and begining with a 1 or 2 that, when interpreted as a decimal integer, is a multiple of 5. For example, strings like 12, 101, 120, 110121 are in the language; strings that begin with 0 or are not multiples of 5 such as 0,011, 112, 2201 are not in the language. The alphabet is E={0,1,2). Draw the state transition diagram of a deterministic finite automata (DFA) accepting the language L1. Explain shortly the logic behind your design for this DFA.)