20 points (Sipser problem 1.32) This problem will prove that binary addition is a regular language. Let 23 be the set of all columns of three 0's and 1's: Ea={llElli]lillllillillill A string in 2; contains 3 rows of 0's and 1's. Consider each row a binary number and let B = {w E Z; | the third row of w is the sum of the rst 2 rows}