FINITE AUTOMATA all strings without any ’a’

Question

Let Σ = {a, b, c}

All strings without any ’a’.

Propose FA of language. Please help me.