3. If we define the following tokens * definitions of manifest cons LT, LE, EQ, NE, GT, GE, IF, THEN, ELSE, ID, NUMBER, RELOP ants delim [Itin ws [delim) letter (A-Za-2 digit [0-9] id fletterKletterl(digit]) number (digit)+N(digit+)P(E+JP(digit +)P (ws) U" no action and no return if (return (IF); ) then (return (THEN): else (return (ELSE): id) (vylval (int) installID(): return (ID);) umber) (vylval (int) installNum: return (NUMBER): "c"(yylvala LT; return (RELOP); } "c "(yylval . LE: return (RELOP);} "(yylval EQ: return (RELOP) "(vylval NE; return (RELOP vylval GT: return (RELOP) (yylval GE; return (RELOP): Divide the following code into appropriate lexemes. Which lexemes should get associated lexical values? What should those values be? if x>y then value 60 else value 80 4. Construct NFA from the following regular expressions (011) 010* 5. Convert the following NFAs to DFA. >SO S0,S1) S1,S2) S2 S1 S1 S2 S1) S2)