3. (20 points) Let alphabet [oj [1] [1 = Alphabet contains all columns of 0s and is of height two. A string of symbols in gives two rows of Os and 1s. Consider each row to be an unsigned binary number and let language L {w over | the reverse of the bottom row of w is two times the reverse of the top row) Examples, 11 [11 1o1 [o 0110 11 [11 [11 [o EL, | EL,EEL, but 0 1 01L0 Please construct a minimum DFA for language L, that should read an input string from left to right (15 points). please briefly describe the strings corresponding to each state (5 points)