Question: consider the following lex script abprintf 1 abbprintf...

Consider the following lex script: %% a*b{printf(― 1 ‖);} (a|b)*b{printf(― 2 ‖);} c*{printf(― 3 ‖);} a. Given an example of an input to this scanner that will produce 132 as an output, or explain why one does not exist. b. Explain how lex would tokenize the following input string and the output produced. (i) cbbbbac(ii) cbabc