(25 points) Please design a minimum DFA for the following language (20 points), and please briefly describe the strings corresponding to each state (5 points). L={w over the reverse of the bottom row of w is two times the reverse of the top row } where alphabet contains all columns of 0 s and 1 s of height two. Specifically, contains the following four symbols. ={[00],[01],[10],[11]} A string in language L gives two rows of 0 s and 1 s, and each row is an unsigned binary number. For example, [10][01]L,[10][11][01][00]L,[00][10][01]L,[00]L,L But [00][10]/L,[10][11][11][00]/L,[11]/L