(a) L = $\left \{ a^{n}b^{n} : n \geq1 \right \}\cup \left\{a^{n}b^{m}: n \geq1,m\geq 1 \right \}$
L can also be written as $\left\{a^{n}b^{m}: n \geq1,m\geq 1 \right \}$ as $\left \{ a^{n}b^{n} : n \geq1 \right \}$ is already included in $\left\{a^{n}b^{m}: n \geq1,m\geq 1 \right \}$
L is regular because Regular expression for L is $a^{+}b^{+}$
(b) L = $\left \{ a^{n}b^{n} : n \geq1 \right \}\cup \left\{a^{n}b^{n+2}: n \geq1\right \}$
L = $\left \{ a^{n}b^{n}(\lambda+bb) : n \geq1 \right \}$
Assuming L is a regular language. Let p be the pumping length given by the pumping lemma.
We pick our string , w = $a^{p}b^{p}(\lambda+bb) $, and $\left | w \right | > p$
$w_{i} = xy^{i}z$ , i = 0,1,2,3...
y must contain entirely of a's
suppose $\left | y \right | = k$
then when i = 3, $xy^{3}z = a^{p+3k}b^p(\lambda+bb)$
This shows that $n_{a} > n_{b} $ but no such string exists in L
This indicates that the assumption that L is regular must be false.
Hence L is not regular