$(6$ marks$)$ For each nondeterministic finite automaton below, identify the language accepted.

Try to describe the language in the simplest terms possible.

$($a$)$

$($b$)$