Consider the following string:

abcdetkbyegacxvabyj

This string is first tokenized into words $($using spaces as the delimiters$),$ and then bigrams and their frequencies are computed from these words. This bigram set is then used to autogenerate words.

Assume the following rules are used in the auto$-$generation process:

$-$ The most probable word is chosen at every step based on the frequencies in the bigram set.

$-$ If two possible choices have the same probability, choose the word that appears alphabetically first.

$-$ Stop the generation process if

$-$ there are no successor words with non$-$zero probabilities available

$-$ or we have entered an infinite loop.

When given a start word of $\backslash (\backslash$underline$\{\backslash$mathbf$\{$b$\}\}\backslash ),$ the auto generation process generates which of the following strings?

b d t b

b c d e t k b

b c d e g a b

b y e g a b

None of the options