Answer: d. Statement 1 is an assertion, Statement 2 is the solution.
Step-by-step explanation:
The Longest Match rule is a rule which states that whichever lexeme is scanned should always be determined on the support of the longest match available among all the tokens which is accessible. The lexical analyzer used should also follow the rules arrangement, where a reserved word, e.g., a keyword, in a language is given priority over the user input.