3. (20 points) Let alphabet 0 [0 1 11 Alphabet contains all columns of 0s and is of height two. A string of symbols in gives two rows of 0s 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, E L, I LEE L, but 0 1 0 11 0 0 0 1 0l0 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) Page 1 of 2