Design a DFA accepting the following language overDesign a DFA accepting the following language over the alphabet {0,1}: the set of all strings that, when interpreted in reverse as a binary integer, are divisible by 3. Examples: 0, 11, 10010, 10101. Non-examples: 1, 01, 0111. Never mind the possible leading zeros on the right end.Show transcribed image text