This assignment must be submitted on gradescope. for part i, you must submit a zip folder with jflap files for problem 1 clearly labelled (e. g., 1a. jff). for part ii, you must submit answers for problems 2, 3, and 4. handwritten answers are allowed as long as they are legible. answers typed in latex or word are preferred. each problem must be clearly labelled and answered on a separate page. a 5-point penalty will be applied to submissions that do not follow these guidelines. for more instructions on how to submit assignments on gradescope see this guide. late submissions will be accepted within 0-12 hours after the deadline with a 5-point penalty and within 12-24 hours after the deadline with a 20-point penalty. no late submissions will be accepted more than 24 hours after the deadline. this assignment is individual. offering or receiving any kind of unauthorized or unacknowledged assistance is a violation of the university's academic integrity policies, will result in a grade of zero for the assignment, and will be subject to disciplinary action. part i: turing machines (30 pt.) 1. (30 pt., 10 pt. each) construct a turing machine in jflap (version 7.1) that decides each of the following languages. for each language, you must submit one jflap file clearly labelled (e. g., 1a. jff). note: there is no explicit reject state for turing machines in jflap. we assume that there is a transition to the reject state whenever a state is missing a transition for a particular symbol. a. a = {0"1" m is a multiple of n} b. b = {w e {0,1}' l w does not have the same number of o's and 1's c. c = {w#w#ww€ {0,1}} part ii: proofs (70 pt.) 2. (20 pt.) prove that the following language is not context-free using the pumping lemma: d = {a"bºck | n, m, k 0 and m s min(n, k)} hint: min(n, k) is a function that returns the minimum value out of n and k.