3. (10 points) Let Here, ?2 contains all columns of 0s and is of height two. A string of symbols in ?2 gives two rows of Os and 1s of equal length. Consider each row to represent a binary number (potentially with leading 0s). For example, the string (o) \1)i (bottom row). Design a NFA over ?2 that recognizes the language 0) 1) i) represents the two binary numbers (101)2-5 (top row) and (011)2 -3 (w the number represented by the bottom row is twice that represented by the top row berexample,()(e)(l) ()()()stould should not be accepted (because 3 is not two times 5) but 1) (0) (0) should be accepted (because 4-22) Draw the state diagram of your NFA in JFLAP, export the image as a png or jpg file, and include it as part of your submission. In JFLAP, you can represent elements in 22 as two bits separated by a slash. You do not need to justify your construction for credit, but if you describe how your state diagram works by briefly describing the role of each state and the transitions between them we may be able to award partial credit if your answer is incorrect. Note: you only need two states in your NFA