r-690 E contains all size 3 columns of Os and ls. A string of symbols in I gives three rows of Os and ls. Consider each row to be a binary number and let A= {w e * | the bottom row of w is the sum of the top two rows}. (By convention, the empty string is, vacuously, in A.) Draw the state diagram of a DFA recognizing A *Use 3 states only