Problem \#2 =000,001,010,011,100,101,110,111 A string over can be viewed as three binary values stacked vertically. Let the language D be all strings in which the bottom row is the result of subtracting the middle row from the top row. For this machine, the string is read left to right (i.e., most significant bit first). Draw a DFA that accepts this language