Determine if the each of the following languages are regular. If regular, justify your answer by constructing an FSA. If not regular, use the Pumping Lemma to prove your answer.

a$)\{a^{n}b{c}^n|n0\}$

b$)|0$ is even, $n$ odd