A lexical analyzer uses the following patterns to recognize three tokens $${T_1},{T_2},$$ and $${T_3}$$ over the alphabet $$\left\{ {a,b,c} \right\}.$$

$$\eqalign{ & {T_1}:\,\,\,a?{\left( {b|c} \right)^ * }a \cr & {T_2}:\,\,\,b?{\left( {a|c} \right)^ * }b \cr & {T_3}:\,\,\,c?{\left( {b|a} \right)^ * }c \cr} $$

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 $$bbaacabc$$ is processed by the analyzer, which one of the following is the sequence of tokens it outputs?

Consider the following parse tree for the expression $$a \ne b\$ c\$ d \ne e \ne f,$$ involving two binary operators $$\$ $$ and $$ \ne $$.

Which one of the following is correct for the given parse tree?

Which one of the following statements is FALSE?

Consider a long-lived $$TCP$$ session with an end-to-end bandwidth of $$1$$ $$Gbps$$ ($$ = {10^9}\,$$ bits-persecond). The session starts with a sequence number of $$1234.$$ The minimum time (in seconds, rounded to the closest integer) before this sequence number can be used again is _______.