Goal: This assignment should be thought as part of the Core Tokenizer project. The goal of this assignment is to design a DFA for Core's tokens. The Tokenizer implementation will be the Java/Python -depending on your implementation language- version of the DFA you design for this assignment. The set of tokens of Core are as specified on slide 14 of the file part2.pptx: - Reserved words (11 reserved words): program, begin, end, int, if, then, else, while, loop, read, write - Special symbols (19 special symbols): ;,=![l&&()+!====>= - Integers (unsigned) - Identifiers: start with uppercase letter, followed by zero or more uppercase letters and zero or more digits. Note something like "ABCend" is illegal as an id because of the lowercase letters; and it is not two tokens because of lack of whitespace. But ABC123 and A1B2C3 are both legal. You have to come up with a DFA corresponding to this set of tokens. You do not have to go through the approach of first designing an NFA and then converting the NFA into a DFA. Given the difficulty of working with sets of states and given the relative simpl,icity of the set of legal tokens of Core, it would be far easier to design the DFA directly. What you have to submit: Submit a .pdf file (on Carmen) that shows your DFA including intermediate steps, as appropriate, along with a brief explanation of how the DFA corresponds to Core's tokens, so that the grader can understand your submission. I have posted on Piazza a detailed set of suggestions that should help you design the DFA as well as how to present your design in the Carmen submission