3. (10 pts) Given the alphabet 00 1 1 containing 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 a binary number and let language L-ta E * | the reverse of the bottom row of ais equal to the reverse of the top row plus 1 Design a minimum state DFA for language L, and describe the strings corresponding to each state. Your DFA should read an input string from left to right For example, string 1 10 L, because the reverse of the top row is binary number 0101 and the reverse of the bottom row is binary number 0110. 01 01 11 [O . String | 0| | | |01 |0 , because the reverse of the top row is binary number 0100 and the reverse of the bottom row is binary number 0010 string | 0| |0| 0 L, because the reverse of the top row is binary number 1111 and the reverse of the bottom row is binary number 0000. In this case, there is an overflow, and the reverse of the bottom row is not equal to the reverse of the top row plus 1 3. (10 pts) Given the alphabet 00 1 1 containing 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 a binary number and let language L-ta E * | the reverse of the bottom row of ais equal to the reverse of the top row plus 1 Design a minimum state DFA for language L, and describe the strings corresponding to each state. Your DFA should read an input string from left to right For example, string 1 10 L, because the reverse of the top row is binary number 0101 and the reverse of the bottom row is binary number 0110. 01 01 11 [O . String | 0| | | |01 |0 , because the reverse of the top row is binary number 0100 and the reverse of the bottom row is binary number 0010 string | 0| |0| 0 L, because the reverse of the top row is binary number 1111 and the reverse of the bottom row is binary number 0000. In this case, there is an overflow, and the reverse of the bottom row is not equal to the reverse of the top row plus 1