Problem $1.$ Consider the following regular expressions $($we omit the dot operator$)$

$)3$

Assume that the longest prefix$-$matching rule is used. Assume that ties are broken in favor of the

regular expression listed first in the list.

Give an example of input for which getToken$()$ returns $R_0$

Give an example of input for which getToken$()$ returns $R_1$

Give an example of input for which getToken$()$ returns $R_2$

Give an example of input for which getToken$()$ returns $R_3$

Give an example of input for which getToken$()$ returns $R_4$

If getToken$()$ is called repeatedly on the following input, what is the sequence of tokens

returned?

GGHBFEBAHCDDBEEBAFFEHBGEF

Explain your answers.