A lexical analyzer uses the following patterns to recognize three tokens T1,…

A lexical analyzer uses the following patterns to recognize three tokens T1, T2, and T3 over the alphabet {a,b,c}.

𝑇1: 𝑎? (𝑏|𝑐)∗𝑎

𝑇2: 𝑏? (𝑎|𝑐)∗𝑏

𝑇3: 𝑐? (𝑏|𝑎)∗ 𝑐

Note that ‘$x$?’ means 0 or 1 occurrence of the symbol $x$. Note also that the analyzer outputs the token that matches the longest possible prefix.

If the string 𝑏𝑏𝑎𝑎𝑐𝑎𝑏𝑐 is processed by the analyzer, which one of the following is the sequence of tokens it outputs?