Consider a programming language that allows variable names to contain

alphanumeric characters and underscores, starting with a letter. Design regular

expressions for the language's identifiers and literals. Also, identify any reserved

keywords and explain howthey are recognized by the lexical analyzer.

ii$.$ How does the lexical analyzer handle the removal of comments, where

comments are

defined as follows:

a$.$ A comment begins with $//$ and includes all characters until the end of that line.

b$.$ A comment begins with $/$ and includes all characters through the next occurrence of

the character sequence $/.$