Provide an automaton that recognizes the following language:

= {a, b, c}

L = {a, ab, aa, ac, aaa, aab, aac, aba, abb, abc, . . .}

This is the language of strings that must start with an a, but can then be followed by any number of a's, b's, and c's in any order.