Consider the following regular expressions (i am omitting the dot operator) r0 = 0+1+2+3+4 r1 = 0+1+2+3+4+5 r2 = (0+1)(0*+1*) r3 = (0*+1*) r1 (0+1) r4 = 00 r3*(0+1)* r5 = r3* 000 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 assume that ties are broken in favor of the regular expression listed first in the list. 1. give an example of input for which gettoken() returns r0 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 r3 5. give an example of input for which gettoken() returns r4 6. give an example of input for which gettoken() returns r5 7. if gettoken() is called repeatedly on the following input, what is the sequence of tokens returned? in your work, show step by step the matched, the potential matched, and the maximal matched tokens. 00031010030030111001 for questions 1-6 you should explain your answers