$1.$ For each of the following regular expressions find a language $($i$.$e$.,$ a set of strings$)$ over A $=\{$a$,$b$,$c$\}$

that can be represented$/$described by that expression. $(4$ points$)$

a$.$

$+$

$$ b$.$

$$

$$