Problem 1. Consider the following regular expressions (omitting the dot operator) R1 = a | b | c | d R2 (a | b) (a* | b*) R3 (a* b) R1 (ab) (ab) R5 = R3* aaa R2* Let getToken () be a function that returns the next token in the input. If we call it repeatedly it will return one token after another. When all the input is consumed, getToken() returns EOlF (end of file). Assume that longest prefix-matching rule is used by getToken() and ties are broken in favor of the regular expression listed first 1. Give an example of input for which getToken() returns Ro 2. Give an example of input for which getToken() returns R1 3. Give an example of input for which getToken) returns R2 4. Give an example of input for which getToken() returns R:3 5. Give an example of input for which getToken() returns R4 6. Give an example of input for which getToken() returns Rs 7. If getToken() is called repeatedly on the following input, what is the sequence of tokens and lexemes returned? In your work, show step by step the Matched, Potential (Viable), and Maximal tokens aaadbabaadaaadabbbaab