. Let L be the language over the alphabet = {0, 1} such that L consists of strings which end with 10 and in which the number of 0s is a multiple of 3. Draw state-transition diagram of a DFA that accepts L.

1. Let L be the language over the alphabet = {0, 1} such that L consists of strings which end with 10 and in which the number of O's is a multiple of 3. Draw state-transition diagram of a DFA that accepts L