Draw a Finite State Machine diagram for recognizing all the tokens in this list (int, if, else, while, do, continue, break, return, auto, double, if, static, break, else, int, struct, case, enum, long, switch, char, extern, register, typedef, continue, float, return, union, default, for, short, unsigned, do, goto, size, of, while). There should be a start state in the center. Each edge of the diagram should be labelled with the input character or characters causing the transition along that edge. You may use "digit" instead of listing all the individual digits, and "letter" for all the 52 upper and lower case letters, and "not double-quote" inside string tokens. Otherwise, label with the actual characters. Well, you can say "space" and "tab" and "newline" for those characters. Each final state should be double-circled and labelled inside with the token it is recognizing (one and two character symbol tokens may just use themselves as labels)