Buikl deterministic finite automata for each of the following languages. . Create simple meaningful automata rather than using the algorithm to create a DFA from an NFA, which can be quite complex and confusing and explain how they work. . In all cases the alphabet is 5 = {0,1}. The set of all strings beginning with a 1 such that, interpreted as a binary representation of an integer. it has a remainder of 1 when divided by 3. For example, the binary number 1010, is decimal 10. When you divide 10 by 3 you get a remainder of 1. so 1010 is in the language. However, the binary number 1111. is decimal 15. When you divide 15 by 3 you get a remainder of 0. so 1111 is not in the language. Hint: if you have a binary string, such as 1100s, which is 12 in decimal, what happens if you add a 0 to the right end? You get 11000, which in decimal is 24. What happens if you add a 1 to the right end? You get 11001, which is decimal 25. Think carefully about all cases: What happens to the remainder when you add a 0? What happens when you add a 1