Problem 1 [50 points] For each of the following languages, construct a Turing machine in JFLAP, version 7, that decides the language. To receive full credit for each language, you must submit three files: (1) the JFLAP file (e.g., 1a.jff); (2) a text file (e.g. la-accept.txt) with five strings that are in the language, one per line; and (3) a text file (e.g., 1a-reject.txt) with five strings that are not in the language, one per line. In total, you should have 9 files. Note that there is no explicit reject state in JFLAP. We assume that there is a transition to the reject state whenever a state lacks an outgoing transition for a particular symbol. a. A-{w | w ? {0.1)" contains twice as many Os as is) b. B-tu, u ? {o. 1)" does not contain an equal number of 0s and 1s} Problem 1 [50 points] For each of the following languages, construct a Turing machine in JFLAP, version 7, that decides the language. To receive full credit for each language, you must submit three files: (1) the JFLAP file (e.g., 1a.jff); (2) a text file (e.g. la-accept.txt) with five strings that are in the language, one per line; and (3) a text file (e.g., 1a-reject.txt) with five strings that are not in the language, one per line. In total, you should have 9 files. Note that there is no explicit reject state in JFLAP. We assume that there is a transition to the reject state whenever a state lacks an outgoing transition for a particular symbol. a. A-{w | w ? {0.1)" contains twice as many Os as is) b. B-tu, u ? {o. 1)" does not contain an equal number of 0s and 1s}