Consider the language over the alphabet = {0, 1} containing strings which include nonempty binaries (strings with O's and 1's) that start with 1 and end with 0 and have at least three digits. For example, 110 and 1100 are such binaries, while 10 and 010 are not. 1. Write a regular expression for this language [2 pts] 2. Draw a DFA diagram for this language, with no more than six states. [6 pts] 3. Is the language regular? Why or why not? [2 pts]