Question $2$

Prove by construction that, if $A$ is a regular language, then $A^{+}$is a regular language. Where $A^{+}$is defined as

$A^{+}=u_k=1^{}{A}^k$

is $A^{**}$ without $k=0.)$