Problem 1. Consider the following regular expressions (omitting the dot operator) R1 = a l b l c l d R3 = (a I b) (a* | b* ) R3 = (a* | b*) R1 (ab) (ab)" Ra = ab R3* (a | b)* 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 EOF (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. Problem 1. Consider the following regular expressions (omitting the dot operator) R1 = a l b l c l d R3 = (a I b) (a* | b* ) R3 = (a* | b*) R1 (ab) (ab)" Ra = ab R3* (a | b)* 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 EOF (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