Who can help me solve this with de detail explain.

3. (20 points) Let alphabet = Alphabet contains all columns of 0s and 1s 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 I the reverse of the bottom row of w is two times the reverse of the top row} xauiples, 01 [1] [0 EL, I,,I EL, e EL, but 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)