Write a program which contains a lexical analyzer for the VSL programming language describe in the document posted on Blackboard. The input to the program is a VSL program. The output will be a sequence of (lexeme.token) pairs. You are to wire your lexical analyzer using lex or flex, or you can hand code the program with a 'reasonable" programming language (Java. C. Ada. or Python.) How you handle reserved words (like if. while, etc.) is up to you. You can preload the symbol table with them. OR you can have the lexical analyzer hand e them as a special case. For example if your program is: program var N as int; var squareroot as int; begin N: reading; SORT: = 0; % go until squareroot := squareroot N do squareroot + 1; end; squareroot := squareroot - 1;% subtract one squareroot is lessthanorequalto squareroot (N) write Int squareroot end your output would look look something like this; etc. Write a program which contains a lexical analyzer for the VSL programming language describe in the document posted on Blackboard. The input to the program is a VSL program. The output will be a sequence of (lexeme.token) pairs. You are to wire your lexical analyzer using lex or flex, or you can hand code the program with a 'reasonable" programming language (Java. C. Ada. or Python.) How you handle reserved words (like if. while, etc.) is up to you. You can preload the symbol table with them. OR you can have the lexical analyzer hand e them as a special case. For example if your program is: program var N as int; var squareroot as int; begin N: reading; SORT: = 0; % go until squareroot := squareroot N do squareroot + 1; end; squareroot := squareroot - 1;% subtract one squareroot is lessthanorequalto squareroot (N) write Int squareroot end your output would look look something like this; etc