Let

$\backslash$Sigma

$=$

$\{$

$$

$,$

$$

$,$

$$

$\}$

$\backslash$Sigma $=\{$a$,$b$,$c$\}.$

Give a non$-$deterministic finite automaton that recognizes the set of strings containing no runs of three or more

$$

a$\text{'}$s$.$

E$.$g$.,$ the string

$$

$$

$$

aab is in the language, but

$$

$$

$$

$$

aaab is not.